Sciweavers

407 search results - page 12 / 82
» Query Estimation by Adaptive Sampling
Sort
View
AAAI
2008
14 years 11 months ago
Adaptive Importance Sampling with Automatic Model Selection in Value Function Approximation
Off-policy reinforcement learning is aimed at efficiently reusing data samples gathered in the past, which is an essential problem for physically grounded AI as experiments are us...
Hirotaka Hachiya, Takayuki Akiyama, Masashi Sugiya...
APWEB
2006
Springer
15 years 1 months ago
Sample Sizes for Query Probing in Uncooperative Distributed Information Retrieval
The goal of distributed information retrieval is to support effective searching over multiple document collections. For efficiency, queries should be routed to only those collectio...
Milad Shokouhi, Falk Scholer, Justin Zobel
SIGMOD
1998
ACM
121views Database» more  SIGMOD 1998»
15 years 1 months ago
New Sampling-Based Summary Statistics for Improving Approximate Query Answers
In large data recording and warehousing environments, it is often advantageous to provide fast, approximate answers to queries, whenever possible. Before DBMSs providing highly-ac...
Phillip B. Gibbons, Yossi Matias
ICDE
2007
IEEE
98views Database» more  ICDE 2007»
15 years 3 months ago
Towards Adaptive Costing of Database Access Methods
Most database query optimizers use cost models to identify good query execution plans. Inaccuracies in the cost models can cause query optimizers to select poor plans. In this pap...
Ye Qin, Kenneth Salem, Anil K. Goel
PAMI
2010
146views more  PAMI 2010»
14 years 7 months ago
A Generalized Kernel Consensus-Based Robust Estimator
In this paper, we present a new Adaptive Scale Kernel Consensus (ASKC) robust estimator as a generalization of the popular and state-of-the-art robust estimators such as RANSAC (R...
Hanzi Wang, Daniel Mirota, Gregory D. Hager