Sciweavers

4302 search results - page 318 / 861
» Index Pairs Algorithms
Sort
View
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 5 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
145
Voted
ICIAP
2003
ACM
16 years 4 months ago
Object segmentation using feature based conditional morphology
This paper presents a new technique to segment objects of interest from cluttered background with varying edge densities and illumination conditions from gray scale imagery. An op...
M. Raffay Hamid, Aijaz Baloch, Ahmed Bilal, Nauman...
152
Voted
PDP
2008
IEEE
15 years 11 months ago
Load Balancing Distributed Inverted Files: Query Ranking
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
Carlos Gomez-Pantoja, Mauricio Marín
SISAP
2008
IEEE
115views Data Mining» more  SISAP 2008»
15 years 11 months ago
A Dynamic Pivot Selection Technique for Similarity Search
All pivot-based algorithms for similarity search use a set of reference points called pivots. The pivot-based search algorithm precomputes some distances to these reference points...
Benjamin Bustos, Oscar Pedreira, Nieves R. Brisabo...
154
Voted
VLDB
2004
ACM
98views Database» more  VLDB 2004»
15 years 10 months ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel