Sciweavers

244 search results - page 8 / 49
» High-Dimensional Similarity Retrieval Using Dimensional Choi...
Sort
View
EDBT
2000
ACM
15 years 4 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
SIGMOD
2002
ACM
219views Database» more  SIGMOD 2002»
15 years 12 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...
ICAPR
2001
Springer
15 years 4 months ago
Image Retrieval Using a Hierarchy of Clusters
The goal of this paper is to describe an efficient procedure for color-based image retrieval. The proposed procedure consists of two stages. First, the image data set is hierarchi...
Daniela Stan, Ishwar K. Sethi
113
Voted
EDBT
2009
ACM
184views Database» more  EDBT 2009»
15 years 6 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
ISCC
2006
IEEE
123views Communications» more  ISCC 2006»
15 years 5 months ago
Similarity Search in a Hybrid Overlay P2P Network
P2P systems are increasingly used to discover and share various data between users. The performance of a P2P based information retrieval system is determined by the efficiency of...
Mouna Kacimi, Kokou Yétongnon