1889 search results - page 84 / 378 » Re-ranking search results using query logs |
IJAHUC
2008
13 years 10 months ago
2008
: Random walk and flooding are basic mechanisms for searching unstructured overlays. This paper shows that node coverage is an important metric for query performance in random grap...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
FAW
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Computing the visibility polygon, VP, of a point in a polygonal scene, is a classical problem that has been studied extensively. In this paper, we consider the problem of...
COLT
2001
Springer
14 years 2 months ago
2001
Springer
The Kushilevitz-Mansour (KM) algorithm is an algorithm that finds all the “large” Fourier coefficients of a Boolean function. It is the main tool for learning decision trees ...
ICWSM
2009
13 years 8 months ago
2009
The present study demonstrates how the emotional content of search terms and their eventual results affects the breadth of a users' search for information. We observed the qu...