3341 search results - page 271 / 669 » On Bounded Queries and Approximation |
279
click to vote
MMS
2011
15 years 1 months ago
2011
Abstract In recent years, some approximate highdimensional indexing techniques have shown promising results by trading off quality guarantees for improved query performance. While ...
257
click to vote
GIS
2006
ACM
16 years 7 months ago
2006
ACM
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...
293
click to vote
ICDE
2006
IEEE
16 years 8 months ago
2006
IEEE
Current approaches for answering queries with imprecise constraints require user-specific distance metrics and importance measures for attributes of interest - metrics that are ha...
175
click to vote
SIGMOD
2004
ACM
16 years 6 months ago
2004
ACM
Trees and graphs are widely used to model biological databases. Providing efficient algorithms to support tree-based or graph-based querying is therefore an important issue. In th...
197
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We propose a novel mechanism for answering sets of counting queries under differential privacy. Given a workload of counting queries, the mechanism automatically selects a differ...