Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
Ting Liu, Andrew W. Moore, Alexander G. Gray, Ke Y...
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results s...
Alexander Hinneburg, Charu C. Aggarwal, Daniel A. ...
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...
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...