1889 search results - page 269 / 378 » Re-ranking search results using query logs |
181
click to vote
TREC
2003
15 years 7 months ago
2003
The TREC 2003 web track consisted of both a non-interactive stream and an interactive stream. Both streams worked with the .GOV test collection. The non-interactive stream continu...
289
click to vote
ICDE
2002
IEEE
16 years 7 months ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
204
click to vote
WADS
2007
Springer
16 years 18 days ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
178
click to vote
COMPGEOM
2009
ACM
16 years 1 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
193
click to vote
ISAAC
2004
Springer
15 years 12 months ago
2004
Springer
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, ...