Sciweavers

105 search results - page 3 / 21
» Optimal importance sampling for the approximation of integra...
Sort
View
DMSN
2004
ACM
14 years 23 days ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
DASFAA
2009
IEEE
134views Database» more  DASFAA 2009»
14 years 2 months ago
Selectivity Estimation for Exclusive Query Translation in Deep Web Data Integration
In Deep Web data integration, some Web database interfaces express exclusive predicates of the form Qe = Pi(Pi ∈ P1, P2, . . . , Pm), which permits only one predicate to be selec...
Fangjiao Jiang, Weiyi Meng, Xiaofeng Meng
ALGORITHMICA
2008
78views more  ALGORITHMICA 2008»
13 years 7 months ago
Optimally Adaptive Integration of Univariate Lipschitz Functions
We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an error of at most using as...
Ilya Baran, Erik D. Demaine, Dmitriy A. Katz
SIGMOD
2001
ACM
229views Database» more  SIGMOD 2001»
14 years 7 months ago
A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
14 years 1 months ago
Derby/S: a DBMS for sample-based query answering
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
Anja Klein, Rainer Gemulla, Philipp Rösch, Wo...