Sciweavers

144 search results - page 16 / 29
» Query dependent ranking using K-nearest neighbor
Sort
View
PVLDB
2010
97views more  PVLDB 2010»
13 years 6 months ago
Ranking Continuous Probabilistic Datasets
Ranking is a fundamental operation in data analysis and decision support, and plays an even more crucial role if the dataset being explored exhibits uncertainty. This has led to m...
Jian Li, Amol Deshpande
ICIP
2006
IEEE
14 years 9 months ago
An Efficient Method for the Removal of Impulse Noise
A computationally efficient algorithm is proposed to remove noise impulses from speech and audio signals while retaining its features and tonal quality. The proposed method is bas...
Wenbin Luo, Dung Dang
CVPR
2004
IEEE
14 years 9 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
PDP
2008
IEEE
14 years 2 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
ICASSP
2010
IEEE
13 years 7 months ago
Searching with expectations
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
Harsimrat Sandhawalia, Herve Jegou