2514 search results - page 191 / 503 » On the Computation of Approximations of Database Queries |
178
click to vote
VLDB
2004
ACM
15 years 12 months ago
2004
ACM
Declarative queries are proving to be an attractive paradigm for interacting with networks of wireless sensors. The metaphor that “the sensornet is a database” is problematic,...
161
click to vote
VLDB
2001
ACM
15 years 11 months ago
2001
ACM
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...
156
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
183
click to vote
COMPGEOM
1998
ACM
15 years 10 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
179
click to vote
SIAMCOMP
2000
15 years 6 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...