Sciweavers

1889 search results - page 142 / 378
» Re-ranking search results using query logs
Sort
View
COMPGEOM
2003
ACM
14 years 4 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
MMS
2007
13 years 10 months ago
Evaluating a workspace's usefulness for image retrieval
Image searching is a creative process. We have proposed a novel image retrieval system that supports creative search sessions by allowing the user to organise their search results ...
Jana Urban, Joemon M. Jose
ICALP
2004
Springer
14 years 4 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
ICDE
2009
IEEE
251views Database» more  ICDE 2009»
15 years 16 days ago
Contextual Ranking of Keywords Using Click Data
The problem of automatically extracting the most interesting and relevant keyword phrases in a document has been studied extensively as it is crucial for a number of applications. ...
Utku Irmak, Vadim von Brzeski, Reiner Kraft
ECIR
2010
Springer
14 years 8 days ago
Enabling Interactive Query Expansion through Eliciting the Potential Effect of Expansion Terms
Despite its potential to improve search effectiveness, previous research has shown that the uptake of interactive query expansion (IQE) is limited. In this paper, we investigate on...
Nuzhah Gooda Sahib, Anastasios Tombros, Ian Ruthve...