Sciweavers

2883 search results - page 278 / 577
» Algorithms for merged indexes
Sort
View
CORR
2010
Springer
100views Education» more  CORR 2010»
15 years 6 months ago
Products of Weighted Logic Programs
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
Shay B. Cohen, Robert J. Simmons, Noah A. Smith
ICDE
2000
IEEE
168views Database» more  ICDE 2000»
16 years 7 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
ICIAP
2003
ACM
16 years 6 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...
PDP
2008
IEEE
16 years 10 days 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»
16 years 9 days 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...