18 search results - page 2 / 4 » Junction tree decomposition for parallel exact inference |
JMLR
2010
13 years 2 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
AI
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. Dynamic Bayesian networks (DBNs) extend Bayesian networks from static domains to dynamic domains. The only known generic method for exact inference in DBNs is based on dy...
IPSN
2005
Springer
14 years 29 days ago
2005
Springer
— Many inference problems that arise in sensor networks require the computation of a global conclusion that is consistent with local information known to each node. A large class...
COLING
2008
13 years 9 months ago
2008
This paper describes a parameter estimation method for multi-label classification that does not rely on approximate inference. It is known that multi-label classification involvin...
NIPS
2003
13 years 8 months ago
2003
Rao–Blackwellization is an approximation technique for probabilistic inference that flexibly combines exact inference with sampling. It is useful in models where conditioning o...