Sciweavers

139 search results - page 9 / 28
» Approximations of upper and lower probabilities by measurabl...
Sort
View
UAI
2003
14 years 10 months ago
Approximate Decomposition: A Method for Bounding and Estimating Probabilistic and Deterministic Queries
In this paper, we introduce a method for approximating the solution to inference and optimization tasks in uncertain and deterministic reasoning. Such tasks are in general intract...
David Larkin
SUTC
2010
IEEE
15 years 1 months ago
A Log-Ratio Information Measure for Stochastic Sensor Management
—In distributed sensor networks, computational and energy resources are in general limited. Therefore, an intelligent selection of sensors for measurements is of great importance...
Daniel Lyons, Benjamin Noack, Uwe D. Hanebeck
NIPS
1998
14 years 10 months ago
Inference in Multilayer Networks via Large Deviation Bounds
We study probabilistic inference in large, layered Bayesian networks represented as directed acyclic graphs. We show that the intractability of exact inference in such networks do...
Michael J. Kearns, Lawrence K. Saul
INFOCOM
2010
IEEE
14 years 8 months ago
Reliability in Layered Networks with Random Link Failures
—We consider network reliability in layered networks where the lower layer experiences random link failures. In layered networks, each failure at the lower layer may lead to mult...
Kayi Lee, Hyang-Won Lee, Eytan Modiano
EDBT
2009
ACM
207views Database» more  EDBT 2009»
15 years 21 days ago
Evaluating probability threshold k-nearest-neighbor queries over uncertain data
In emerging applications such as location-based services, sensor monitoring and biological management systems, the values of the database items are naturally imprecise. For these ...
Reynold Cheng, Lei Chen 0002, Jinchuan Chen, Xike ...