360 search results - page 36 / 72 » Dynamic Sample Selection for Approximate Query Processing |
ICML
2004
IEEE
16 years 18 days ago
2004
IEEE
Computer experiments often require dense sweeps over input parameters to obtain a qualitative understanding of their response. Such sweeps can be prohibitively expensive, and are ...
183
click to vote
VLDB
2007
ACM
16 years 19 hour ago
2007
ACM
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
142
click to vote
VLDB
1995
ACM
15 years 3 months ago
1995
ACM
Parallel database systems have to support the effective parallelization of complex queries in multi-user mode, i.e. in combination with inter-query/inter-transaction parallelism. ...
134
click to vote
MDM
2010
Springer
14 years 10 months ago
2010
Springer
—We present an optimal distributed algorithm to adapt the placement of a single operator in high communication cost networks, such as a wireless sensor network. Our parameterfree...
ICGA
1993
15 years 1 months ago
1993
In this paper, we present e cient algorithms for adjusting con guration parameters of genetic algorithms that operate in a noisy environment. Assuming that the population size is ...