Sciweavers

2 search results - page 1 / 1
» Exploiting Within-Clique Factorizations in Junction-Tree Alg...
Sort
View
JMLR
2010
118views more  JMLR 2010»
13 years 5 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
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...
Julian John McAuley, Tibério S. Caetano
IJUFKS
2000
111views more  IJUFKS 2000»
13 years 10 months ago
A Factorized Representation of Independence of Causal Influence and Lazy Propagation
Theefficiency of algorithmsfor probabilistic inference in Bayesian networks can be improvedby exploiting independenceof causal influence. Thefactorized representation of independe...
Anders L. Madsen, Bruce D'Ambrosio