158 search results - page 2 / 32 » On Optimizing Nearest Neighbor Queries in High-Dimensional D... |
STOC
1998
ACM
14 years 3 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...
COCOON
1998
Springer
14 years 3 months ago
1998
Springer
Abstract. In this paper we present the new data structure Colored Sector Search Tree (CSST ) for solving the Nearest-Foreign-Neighbor Query Problem (NFNQP ): Given a set S of n col...
DAWAK
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
SIGMOD
2009
ACM
14 years 11 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...
ICCV
2007
IEEE
15 years 24 days ago
2007
IEEE
Matching of high-dimensional features using nearest neighbors search is an important part of image matching methods which are based on local invariant features. In this work we hi...