Sciweavers

360 search results - page 29 / 72
» Dynamic Sample Selection for Approximate Query Processing
Sort
View
PLDI
2012
ACM
13 years 2 months ago
Proving acceptability properties of relaxed nondeterministic approximate programs
Approximate program transformations such as skipping tasks [29, 30], loop perforation [21, 22, 35], reduction sampling [38], multiple selectable implementations [3, 4, 16, 38], dy...
Michael Carbin, Deokhwan Kim, Sasa Misailovic, Mar...
BTW
2007
Springer
142views Database» more  BTW 2007»
15 years 6 months ago
Algebraic Query Optimization for Distributed Top-k Queries
: Distributed top-k query processing is increasingly becoming an essential functionality in a large number of emerging application classes. This paper addresses the efficient alge...
Thomas Neumann, Sebastian Michel
FLAIRS
2004
15 years 1 months ago
Experience-Based Resource Description and Selection in Multiagent Information Retrieval
In this paper, we propose an agent-centric approach to resource description and selection in a multiagent information retrieval (IR). In the multiagent system, each agent learns f...
Leen-Kiat Soh
DCOSS
2011
Springer
13 years 11 months ago
On sensor selection in linked information networks
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
Charu C. Aggarwal, Amotz Bar-Noy, Simon Shamoun
AAAI
2006
15 years 1 months ago
Efficient Active Fusion for Decision-Making via VOI Approximation
Active fusion is a process that purposively selects the most informative information from multiple sources as well as combines these information for achieving a reliable result ef...
Wenhui Liao, Qiang Ji