Sciweavers

3630 search results - page 286 / 726
» Fast Marching Methods
Sort
View
DC
2008
15 years 6 months ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat
PR
2008
178views more  PR 2008»
15 years 4 months ago
An effective and fast iris recognition system based on a combined multiscale feature extraction technique
The randomness of iris pattern makes it one of the most reliable biometric traits. On the other hand, the complex iris image structure and the various sources of intra-class varia...
Makram Nabti, Ahmed Bouridane
SIAMSC
2010
215views more  SIAMSC 2010»
15 years 4 months ago
A Fast Algorithm for Sparse Reconstruction Based on Shrinkage, Subspace Optimization, and Continuation
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
Zaiwen Wen, Wotao Yin, Donald Goldfarb, Yin Zhang
TMI
2010
123views more  TMI 2010»
15 years 4 months ago
Spherical Demons: Fast Diffeomorphic Landmark-Free Surface Registration
—We present the Spherical Demons algorithm for registering two spherical images. By exploiting spherical vector spline interpolation theory, we show that a large class of regular...
B. T. Thomas Yeo, Mert R. Sabuncu, Tom Vercauteren...
BMCBI
2010
121views more  BMCBI 2010»
15 years 3 months ago
A grammar-based distance metric enables fast and accurate clustering of large sets of 16S sequences
Background: We propose a sequence clustering algorithm and compare the partition quality and execution time of the proposed algorithm with those of a popular existing algorithm. T...
David J. Russell, Samuel F. Way, Andrew K. Benson,...