123 search results - page 15 / 25 » Computing upper and lower bounds on likelihoods in intractab... |
ECSQARU
1995
Springer
13 years 11 months ago
1995
Springer
The paper presents a method for uncertainty propagation in Bayesian networks in symbolic, as opposed to numeric, form. The algebraic structure of probabilities is characterized. Th...
AAAI
1996
13 years 8 months ago
1996
The paper presents an efficient goal oriented algorithm for symbolic propagation in Bayesian networks. The proposed algorithm performs symbolic propagation using numerical methods...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
The problem of cooperatively performing a set of t tasks in a decentralized setting where the computing medium is subject to failures is one of the fundamental problems in distrib...
SODA
2008
ACM
13 years 8 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
In some application domains, such as medical imaging, the objects that compose the scene are known as well as some of their properties and their spatial arrangement. We can take ad...