Sciweavers

360 search results - page 42 / 72
» Dynamic Sample Selection for Approximate Query Processing
Sort
View
ICDE
2012
IEEE
304views Database» more  ICDE 2012»
13 years 2 months ago
Learning-based Query Performance Modeling and Prediction
— Accurate query performance prediction (QPP) is central to effective resource management, query optimization and query scheduling. Analytical cost models, used in current genera...
Mert Akdere, Ugur Çetintemel, Matteo Rionda...
IPSN
2010
Springer
15 years 6 months ago
Bayesian optimization for sensor set selection
We consider the problem of selecting an optimal set of sensors, as determined, for example, by the predictive accuracy of the resulting sensor network. Given an underlying metric ...
Roman Garnett, Michael A. Osborne, Stephen J. Robe...
WWW
2004
ACM
16 years 13 days ago
Best bets: thousands of queries in search of a client
A number of applications require selecting targets for specific contents on the basis of criteria defined by the contents providers rather than selecting documents in response to ...
Giuseppe Attardi, Andrea Esuli, Maria Simi
PE
2010
Springer
170views Optimization» more  PE 2010»
14 years 10 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale
CIKM
2003
Springer
15 years 5 months ago
Using titles and category names from editor-driven taxonomies for automatic evaluation
Evaluation of IR systems has always been difficult because of the need for manually assessed relevance judgments. The advent of large editor-driven taxonomies on the web opens the...
Steven M. Beitzel, Eric C. Jensen, Abdur Chowdhury...