89 search results - page 4 / 18 » Fast Algorithm for Nearest Neighbor Search Based on a Lower ... |
119
click to vote
ICPR
2000
IEEE
16 years 3 months ago
2000
IEEE
This paper presents an algorithm, called the winnerupdate algorithm, for accelerating the nearest neighbor search. By constructing a hierarchical structure ,for each feature point...
156
Voted
SDM
2012
SIAM
13 years 5 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
110
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
187
Voted
ICML
2006
IEEE
15 years 11 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...
127
Voted
FOCS
2004
IEEE
15 years 6 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...