89 search results - page 5 / 18 » Fast Algorithm for Nearest Neighbor Search Based on a Lower ... |
STOC
2006
ACM
14 years 8 months ago
2006
ACM
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 ...
3DIM
2003
IEEE
14 years 1 months ago
2003
IEEE
This paper describes a novel method which extends the search algorithm of a k-d tree for aligning and merging range images. If the nearest neighbor point is far from a query, many...
TVCG
2010
13 years 6 months ago
2010
—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...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
DMIN
2007
13 years 9 months ago
2007
K-Nearest Neighbor is used broadly in text classification, but it has one deficiency—computational efficiency. In this paper, we propose a heuristic search way to find out the k ...