Sciweavers

135 search results - page 3 / 27
» High dimensional nearest neighbor searching
Sort
View
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
COCOON
1998
Springer
13 years 9 months ago
The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries
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...
Thomas Graf, V. Kamakoti, N. S. Janaki Latha, C. P...
STOC
1999
ACM
80views Algorithms» more  STOC 1999»
13 years 9 months ago
Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems
Allan Borodin, Rafail Ostrovsky, Yuval Rabani
CVPR
2003
IEEE
14 years 7 months ago
Nearest Neighbor Search for Relevance Feedback
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...
Jelena Tesic, B. S. Manjunath
DEXAW
1999
IEEE
168views Database» more  DEXAW 1999»
13 years 9 months ago
Using the Distance Distribution for Approximate Similarity Queries in High-Dimensional Metric Spaces
We investigate the problem of approximate similarity (nearest neighbor) search in high-dimensional metric spaces, and describe how the distance distribution of the query object ca...
Paolo Ciaccia, Marco Patella