Sciweavers

43 search results - page 3 / 9
» Nearest Neighbor Search on Vertically Partitioned High-Dimen...
Sort
View
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
13 years 9 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
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...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
14 years 5 months ago
Efficient k-NN search on vertically decomposed data
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
Arjen P. de Vries, Nikos Mamoulis, Niels Nes, Mart...
ICCV
2007
IEEE
14 years 7 months ago
High-Dimensional Feature Matching: Employing the Concept of Meaningful Nearest Neighbors
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...
Dusan Omercevic, Ondrej Drbohlav, Ales Leonardis
SIGMOD
2009
ACM
235views Database» more  SIGMOD 2009»
14 years 5 months ago
Quality and efficiency in high dimensional nearest neighbor search
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...
Yufei Tao, Ke Yi, Cheng Sheng, Panos Kalnis
ICDT
2001
ACM
116views Database» more  ICDT 2001»
13 years 9 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...