Sciweavers

178 search results - page 31 / 36
» Mining Web Query Hierarchies from Clickthrough Data
Sort
View
WWW
2005
ACM
14 years 8 months ago
Sampling search-engine results
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...
Aris Anagnostopoulos, Andrei Z. Broder, David Carm...
DKE
2008
109views more  DKE 2008»
13 years 7 months ago
Deterministic algorithms for sampling count data
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by da...
Hüseyin Akcan, Alex Astashyn, Hervé Br...
SIGIR
2002
ACM
13 years 7 months ago
Web question answering: is more always better?
This paper describes a question answering system that is designed to capitalize on the tremendous amount of data that is now available online. Most question answering systems use ...
Susan T. Dumais, Michele Banko, Eric Brill, Jimmy ...
WWW
2008
ACM
14 years 8 months ago
Geographic web usage estimation by monitoring DNS caches
DNS is one of the most actively used distributed databases on earth, accessed by millions of people every day to transparently convert host names into IP addresses and vice versa....
Hüseyin Akcan, Torsten Suel, Hervé Br&...
ISAAC
2004
Springer
112views Algorithms» more  ISAAC 2004»
14 years 29 days ago
Dynamic Tree Cross Products
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
Marcus Raitner