1038 search results - page 21 / 208 » Space-Bounded Query Approximation |
105
click to vote
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
We present a data structure for answering approximate shortest path queries in a planar subdivision from a fixed source. Let 1 be a real number. Distances in each face of this sub...
100
click to vote
PODS
1999
ACM
15 years 3 months ago
1999
ACM
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
111
click to vote
SEBD
2003
15 years 28 days ago
2003
Abstract. Sensor networks represent a non traditional source of information, as readings generated by sensors flow continuously, leading to an infinite stream of data. Traditiona...
169
click to vote
VLDB
2007
ACM
15 years 11 months ago
2007
ACM
Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in ...
123
click to vote
DC
2008
14 years 11 months ago
2008
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...