Sciweavers

134 search results - page 11 / 27
» Approximate Nearest Neighbor Queries in Fixed Dimensions
Sort
View
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 16 hour ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray

Publication
417views
15 years 6 months ago
Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
Peter N. Yianilos
SWAP
2007
14 years 10 months ago
Semantic Nearest Neighbor Search in OWL Ontologies
Abstract. A nearest neighbor search procedure is presented, for retrieving resources in knowledge bases expressed in OWL. The procedure exploits a semidistance for annotated resour...
Nicola Fanizzi, Claudia d'Amato, Floriana Esposito
VLDB
1999
ACM
118views Database» more  VLDB 1999»
15 years 1 months ago
Similarity Search in High Dimensions via Hashing
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
Aristides Gionis, Piotr Indyk, Rajeev Motwani
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
15 years 11 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...