Sciweavers

467 search results - page 46 / 94
» Processing top k queries from samples
Sort
View
WWW
2007
ACM
14 years 9 months ago
Determining the user intent of web search engine queries
Determining the user intent of Web searches is a difficult problem due to the sparse data available concerning the searcher. In this paper, we examine a method to determine the us...
Bernard J. Jansen, Danielle L. Booth, Amanda Spink
SIGMOD
2007
ACM
165views Database» more  SIGMOD 2007»
14 years 9 months ago
Sharing aggregate computation for distributed queries
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
Ryan Huebsch, Minos N. Garofalakis, Joseph M. Hell...
WWW
2009
ACM
14 years 9 months ago
Fast dynamic reranking in large graphs
In this paper we consider the problem of re-ranking search results by incorporating user feedback. We present a graph theoretic measure for discriminating irrelevant results from ...
Purnamrita Sarkar, Andrew W. Moore
SSD
2009
Springer
233views Database» more  SSD 2009»
14 years 3 months ago
Approximate Evaluation of Range Nearest Neighbor Queries with Quality Guarantee
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a lo...
Chi-Yin Chow, Mohamed F. Mokbel, Joe Naps, Suman N...
SGP
2007
13 years 11 months ago
A streaming algorithm for surface reconstruction
We present a streaming algorithm for reconstructing closed surfaces from large non-uniform point sets based on a geometric convection technique. Assuming that the sample points ar...
Rémi Allègre, Raphaëlle Chaine,...