3341 search results - page 79 / 669 » On Bounded Queries and Approximation |
COMPGEOM
2007
ACM
15 years 1 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...
PODS
1999
ACM
15 years 2 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 ...
157
click to vote
VLDB
2007
ACM
15 years 10 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 ...
AAAI
2007
15 years 5 days ago
2007
The Closed-World Assumption (CWA) on databases expresses that an atom not in the database is false. A more appropriate assumption for databases that are sound but partially incomp...
CCCG
2010
14 years 11 months ago
2010
Let