Browsing by Keywords "Algorithms"
Now showing items 1-20 of 437
-
2-D adaptive prediction based Gaussianity tests in microcalcification detection
(SPIE, 1998-01)With increasing use of Picture Archiving and Communication Systems (PACS), Computer-aided Diagnosis (CAD) methods will be more widely utilized. In this paper, we develop a CAD method for the detection of microcalcification ... -
Accelerated phase-cycled SSFP imaging with compressed sensing
(Institute of Electrical and Electronics Engineers Inc., 2015)Balanced steady-state free precession (SSFP) imaging suffers from irrecoverable signal losses, known as banding artifacts, in regions of large B0 field inhomogeneity. A common solution is to acquire multiple phase-cycled ... -
Accuracy and efficiency considerations in the solution of extremely large electromagnetics problems
(IEEE, 2011)This study considers fast and accurate solutions of extremely large electromagnetics problems. Surface formulations of large-scale objects lead to dense matrix equations involving millions of unknowns. Thanks to recent ... -
Accurate modeling of metamaterials with MLFMA
(2006)Electromagnetic modelling of large metamaterial (MM) structures employing multilevel fast multipole algorithm (MLFMA) is reported. MMs are usually constructed by periodically embedding unit cells, such as split-ring ... -
Active pixel merging on hypercube multicomputers
(Springer, Berlin, Heidelberg, 1996)This paper presents algorithms developed for pixel merging phase of object-space parallel polygon rendering on hypercube-connected multicomputers. These algorithms reduce volume of communication in pixel merging phase by ... -
Adaptation of multiway-merge sorting algorithm to MIMD architectures with an experimental study
(Bilkent University, 2002)Sorting is perhaps one of the most widely studied problems of computing. Numerous asymptotically optimal sequential algorithms have been discovered. Asymptotically optimal algorithms have been presented for varying ... -
Adaptive filtering approaches for non-Gaussian stable processes
(IEEE, 1995-05)A large class of physical phenomenon observed in practice exhibit non-Gaussian behavior. In this paper, α-stable distributions, which have heavier tails than Gaussian distribution, are considered to model non-Gaussian ... -
Adaptive filtering for non-gaussian stable processes
(IEEE, 1994)A large class of physical phenomenon observed in practice exhibit non-Gaussian behavior. In this letter, a-stable distributions, which have heavier tails than Gaussian distribution, are considered to model non-Gaussian ... -
Adaptive routing framework for network on chip architectures
(ACM, 2016-01)In this paper we suggest and demonstrate the idea of applying multiple routing algorithms during the execution of a real application mapped on a Network-on-Chip (NoC). Traffic pattern of a real application may change during ... -
Adaptive tracking of narrowband HF channel response
(Wiley-Blackwell Publishing, 2003)Estimation of channel impulse response constitutes a first step in computation of scattering function, channel equalization, elimination of multipath, and optimum detection and identification of transmitted signals through ... -
An adaptive, energy-aware and distributed fault-tolerant topology-control algorithm for heterogeneous wireless sensor networks
(Elsevier BV, 2016)This paper introduces an adaptive, energy-aware and distributed fault-tolerant topology-control algorithm, namely the Adaptive Disjoint Path Vector (ADPV) algorithm, for heterogeneous wireless sensor networks. In this ... -
Algebraic acceleration and regularization of the source reconstruction method with the recompressed adaptive cross approximation
(IEEE, 2014)We present a compression algorithm to accelerate the solution of source reconstruction problems that are formulated with integral equations and defined on arbitrary three-dimensional surfaces. This compression technique ... -
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
(Elsevier, 1996)We propose a method for finding the efficient set of a multiple objective linear program based on the well-known facial decomposition of the efficient set. The method incorporates a simple linear programming test that ... -
Algorithms and basis functions in tomographic reconstruction of ionospheric electron density
(IEEE, 2005)Computerized ionospheric tomography (CIT) is a method to investigate ionosphere electron density in two or three dimensions. This method provides a flexible tool for studying ionosphere. Earth based receivers record signals ... -
Algorithms for effective querying of compound graph-based pathway databases
(BioMed Central Ltd., 2009)Background: Graph-based pathway ontologies and databases are widely used to represent data about cellular processes. This representation makes it possible to programmatically integrate cellular networks and to investigate ... -
Algorithms for efficient vectorization of repeated sparse power system network computations
(IEEE, 1995)Standard sparsity-based algorithms used in power system appllcations need to be restructured for efficient vectorization due to the extremely short vectors processed. Further, intrinsic architectural features of vector ... -
Algorithms for layout of disconnected graphs
(Elsevier, 2000)We present efficient algorithms for the layout of disconnected objects in a graph (isolated nodes and components) for a specified aspect ratio. These linear and near-linear algorithms are based on alternate-bisection and ... -
Algorithms for on-line vertex enumeration problem
(Bilkent University, 2017-09)Vertex enumeration problem is to enumerate all vertices of a polyhedron P which is given by intersection of finitely many halfspaces. It is a basis for many algorithms designed to solve problems from various application ... -
Algorithms for sink mobility in wireless sensor networks to improve network lifetime
(Springer, 2012-09)Sink mobility is an effective solution in the literature for wireless sensor network lifetime improvement. In this paper, we propose a set of algorithms for sink site determination (SSD) and movement strategy problems of ... -
Algorithms for within-cluster searches using inverted files
(Springer, 2006-11)Information retrieval over clustered document collections has two successive stages: first identifying the best-clusters and then the best-documents in these clusters that are most similar to the user query. In this paper, ...
