Sciweavers

9683 search results - page 29 / 1937
» Query performance prediction
Sort
View
ANCS
2005
ACM
14 years 2 months ago
Segmented hash: an efficient hash table implementation for high performance networking subsystems
Hash tables provide efficient table implementations, achieving O(1), query, insert and delete operations at low loads. However, at moderate or high loads collisions are quite freq...
Sailesh Kumar, Patrick Crowley
SIGIR
2003
ACM
14 years 2 months ago
Bayesian extension to the language model for ad hoc information retrieval
We propose a Bayesian extension to the ad-hoc Language Model. Many smoothed estimators used for the multinomial query model in ad-hoc Language Models (including Laplace and Bayes-...
Hugo Zaragoza, Djoerd Hiemstra, Michael E. Tipping
HOTOS
1999
IEEE
14 years 1 months ago
The Case for Better Throughput Estimation
A Web proxy must accurately predict network performance between itself and its servers and clients in order to make good distillation decisions. In this paper, we show that the cu...
Brian Noble, Li Li, Atul Prakash
CIKM
2007
Springer
14 years 3 months ago
Expertise drift and query expansion in expert search
Pseudo-relevance feedback, or query expansion, has been shown to improve retrieval performance in the adhoc retrieval task. In such a scenario, a few top-ranked documents are assu...
Craig Macdonald, Iadh Ounis
SIGMOD
2008
ACM
203views Database» more  SIGMOD 2008»
14 years 9 months ago
Querying continuous functions in a database system
Many scientific, financial, data mining and sensor network applications need to work with continuous, rather than discrete data e.g., temperature as a function of location, or sto...
Arvind Thiagarajan, Samuel Madden