Sampling search-engine results

Aris Anagnostopoulos, Andrei Broder, David Carmel · 2005

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 approximate algorithms for several applications, such as:

Read the paper · More papers on PaperTik