8 search results - page 1 / 2 » Sample Sizes for Query Probing in Uncooperative Distributed ... |
APWEB
2006
Springer
13 years 8 months ago
2006
Springer
The goal of distributed information retrieval is to support effective searching over multiple document collections. For efficiency, queries should be routed to only those collectio...
IPM
2007
13 years 4 months ago
2007
Users of search engines express their needs as queries, typically consisting of a small number of terms. The resulting search engine query logs are valuable resources that can be ...
SIGIR
2006
ACM
13 years 10 months ago
2006
ACM
We present an adaptive distributed query-sampling framework that is quality-conscious for extracting high-quality text database samples. The framework divides the query-based samp...
PODS
2005
ACM
14 years 4 months ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
WWW
2005
ACM
14 years 5 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...