Sciweavers

242 search results - page 27 / 49
» Fast Indexes and Algorithms for Set Similarity Selection Que...
Sort
View
WWW
2005
ACM
14 years 8 months ago
Three-level caching for efficient query processing in large Web search engines
Large web search engines have to answer thousands of queries per second with interactive response times. Due to the sizes of the data sets involved, often in the range of multiple...
Xiaohui Long, Torsten Suel
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 7 months ago
Efficient Clustering with Limited Distance Information
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model ...
Konstantin Voevodski, Maria-Florina Balcan, Heiko ...
KDD
2004
ACM
139views Data Mining» more  KDD 2004»
14 years 7 months ago
Machine learning for online query relaxation
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
Ion Muslea
ICMCS
2006
IEEE
170views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Automatic Query Expansion for News Video Retrieval
In this paper, we present an integrated system for news video retrieval. The proposed system incorporates both speech and visual information in the search mechanisms. The initial ...
Yun Zhai, Jingen Liu, Mubarak Shah
BIOINFORMATICS
2011
12 years 11 months ago
libfbi: a C++ implementation for fast box intersection and application to sparse mass spectrometry data
Abstract. This document is a preprint of the following publication: Bioinformatics (2011) 27(8): 1166-1167. Algorithms for sparse data require fast search and subset selection capa...
Marc Kirchner, Buote Xu, Hanno Steen, Judith A. J....