18 search results - page 3 / 4 » Junction tree decomposition for parallel exact inference |
CVPR
2010
IEEE
14 years 2 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...
UAI
2008
13 years 7 months ago
2008
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
CP
2010
Springer
13 years 3 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
IJUFKS
2000
13 years 5 months ago
2000
Theefficiency of algorithmsfor probabilistic inference in Bayesian networks can be improvedby exploiting independenceof causal influence. Thefactorized representation of independe...