3341 search results - page 215 / 669 » On Bounded Queries and Approximation |
152
click to vote
SIGIR
2005
ACM
16 years 5 days ago
2005
ACM
Previous research into the efficiency of text retrieval systems has dealt primarily with methods that consider inverted lists in sequence; these methods are known as term-at-a-tim...
158
click to vote
PVLDB
2010
15 years 5 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
210
click to vote
ISVC
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keer...
175
click to vote
BDA
2003
15 years 8 months ago
2003
Pervasive computing introduces data management requirements that must be tackled in a growingvariety of lightweight computing devices. Personal folders on chip, networks of sensor...
166
click to vote
SODA
2010
ACM
15 years 5 months ago
2010
ACM
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...