Sciweavers

796 search results - page 135 / 160
» Approximating the centroid is hard
Sort
View
ICDT
2010
ACM
219views Database» more  ICDT 2010»
14 years 5 months ago
Aggregate Queries for Discrete and Continuous Probabilistic XML
Sources of data uncertainty and imprecision are numerous. A way to handle this uncertainty is to associate probabilistic annotations to data. Many such probabilistic database mode...
Serge Abiteboul, T.-H Hubert Chan, Evgeny Kharlamo...
ICDT
2010
ACM
211views Database» more  ICDT 2010»
14 years 5 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis
SDM
2009
SIAM
219views Data Mining» more  SDM 2009»
14 years 4 months ago
A Hybrid Data Mining Metaheuristic for the p-Median Problem.
Metaheuristics represent an important class of techniques to solve, approximately, hard combinatorial optimization problems for which the use of exact methods is impractical. In t...
Alexandre Plastino, Erick R. Fonseca, Richard Fuch...
EUROSYS
2008
ACM
14 years 4 months ago
BorderPatrol: isolating events for black-box tracing
Causal request traces are valuable to developers of large concurrent and distributed applications, yet difficult to obtain. Traces show how a request is processed, and can be anal...
Eric Koskinen, John Jannotti
IPSN
2010
Springer
14 years 2 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause