Sciweavers

89 search results - page 1 / 18
» Efficient Search for Approximate Nearest Neighbor in High Di...
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
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
14 years 6 months ago
PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
Paolo Ciaccia, Marco Patella
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
ICCV
2007
IEEE
14 years 6 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
DEXA
2006
Springer
190views Database» more  DEXA 2006»
13 years 8 months ago
High-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Abstract. Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been ...
Sachin Kulkarni, Ratko Orlandic