Sciweavers

135 search results - page 2 / 27
» High dimensional nearest neighbor searching
Sort
View
IS
2006
13 years 4 months ago
High dimensional nearest neighbor searching
As databases increasingly integrate different types of information such as time-series, multimedia and scientific data, it becomes necessary to support efficient retrieval of mult...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 6 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...
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
246views Database» more  SIGMOD 2002»
14 years 5 months ago
Hierarchical subspace sampling: a unified framework for high dimensional data reduction, selectivity estimation and nearest neig
With the increased abilities for automated data collection made possible by modern technology, the typical sizes of data collections have continued to grow in recent years. In suc...
Charu C. Aggarwal
DAWAK
2005
Springer
13 years 10 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
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...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou