214 search results - page 14 / 43 » Fast Nearest Neighbor Search in High-Dimensional Space |
102
Voted
STOC
2006
ACM
15 years 9 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 ...
SSDBM
2009
IEEE
15 years 4 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 ...
92
Voted
COMPGEOM
2005
ACM
14 years 11 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...
ICML
2008
IEEE
15 years 10 months 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...
65
Voted
NIPS
2007
14 years 11 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...