Sciweavers

107 search results - page 2 / 22
» Approximate Query Answering by Model Averaging
Sort
View
ALT
2009
Springer
14 years 2 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
DOLAP
2005
ACM
13 years 7 months ago
Providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP
A novel framework for providing probabilistically-bounded approximate answers to non-holistic aggregate range queries in OLAP is presented in this paper. Such a framework allows u...
Alfredo Cuzzocrea
PERCOM
2005
ACM
13 years 11 months ago
A Distributed System for Answering Range Queries on Sensor Network Data
A distributed system for approximate query answering on sensor network data is proposed, where a suitable compression technique is exploited to represent data and support query an...
Alfredo Cuzzocrea, Filippo Furfaro, Sergio Greco, ...
EDBT
2009
ACM
118views Database» more  EDBT 2009»
14 years 16 days ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...
VLDB
2005
ACM
129views Database» more  VLDB 2005»
13 years 11 months ago
Sketching Streams Through the Net: Distributed Approximate Query Tracking
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
Graham Cormode, Minos N. Garofalakis