Sciweavers

381 search results - page 7 / 77
» Fast Neighbor Joining
Sort
View
DATE
2008
IEEE
116views Hardware» more  DATE 2008»
15 years 4 months ago
Fast Analog Circuit Synthesis Using Sensitivity Based Near Neighbor Searches
We present an efficient analog synthesis algorithm employing regression models of circuit matrices. Circuit matrix models achieve accurate and speedy synthesis of analog circuits...
Almitra Pradhan, Ranga Vemuri
TVCG
2010
141views more  TVCG 2010»
14 years 8 months ago
Fast Construction of k-Nearest Neighbor Graphs for Point Clouds
—We present a parallel algorithm for k-nearest neighbor graph construction that uses Morton ordering. Experiments show that our approach has the following advantages over existin...
Michael Connor, Piyush Kumar
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
15 years 10 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle
ICCV
2001
IEEE
15 years 11 months ago
Fast Algorithm for Nearest Neighbor Search Based on a Lower Bound Tree
Yong-Sheng Chen, Yi-Ping Hung, Chiou-Shann Fuh
EDBT
2006
ACM
255views Database» more  EDBT 2006»
15 years 10 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald