Sciweavers

649 search results - page 34 / 130
» Search-based query suggestion
Sort
View
ECIR
2010
Springer
13 years 9 months ago
Predicting Query Performance via Classification
We investigate using topic prediction data, as a summary of document content, to compute measures of search result quality. Unlike existing quality measures such as query clarity t...
Kevyn Collins-Thompson, Paul N. Bennett
IWMMDBMS
1996
64views more  IWMMDBMS 1996»
13 years 9 months ago
Spatial Indexing into Compressed Raster Images: How to Answer Range Queries Without Decompression
The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection, such as satellite pi...
Renato Pajarola, Peter Widmayer
SIGIR
2009
ACM
14 years 2 months ago
Estimating query performance using class predictions
We investigate using topic prediction data, as a summary of document content, to compute measures of search result quality. Unlike existing quality measures such as query clarity ...
Kevyn Collins-Thompson, Paul N. Bennett
APPROX
2004
Springer
88views Algorithms» more  APPROX 2004»
14 years 1 months ago
A Stateful Implementation of a Random Function Supporting Parity Queries over Hypercubes
Abstract. Motivated by an open problem recently suggested by Goldreich et al., we study truthful implementations of a random binary function supporting compound XOR queries over su...
Andrej Bogdanov, Hoeteck Wee
BNCOD
2004
184views Database» more  BNCOD 2004»
13 years 9 months ago
Bulk Loading the M-Tree to Enhance Query Performance
The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree's perfo...
Alan P. Sexton, Richard Swinbank