603 search results - page 2 / 121 » Two Algorithms for Nearest-Neighbor Search in High Dimension... |
STOC
1998
ACM
13 years 10 months ago
1998
ACM
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
WEA
2010
Springer
14 years 17 days ago
2010
Springer
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
CVPR
2003
IEEE
14 years 7 months ago
2003
IEEE
We introduce the problem of repetitive nearest neighbor search in relevance feedback and propose an efficient search scheme for high dimensional feature spaces. Relevance feedback...
SIGMOD
2009
ACM
14 years 6 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...