214 search results - page 14 / 43 » Fast Nearest Neighbor Search in High-Dimensional Space |
143
click to vote
STOC
2006
ACM
16 years 3 days 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 ...
105
click to vote
SSDBM
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract. We propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem in Euclidean spaces. Compared to the limitations of existing methods for ...
111
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...
100
click to vote
ICML
2008
IEEE
16 years 18 days ago
2008
IEEE
We present a data structure enabling efficient nearest neighbor (NN) retrieval for bregman divergences. The family of bregman divergences includes many popular dissimilarity measu...
NIPS
2007
15 years 1 months ago
2007
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...