6105 search results - page 48 / 1221 » A Parallel Algorithm for Bound-Smoothing |
135
click to vote
TC
2010
15 years 19 days ago
2010
—In this paper, we investigate data parallelism in exact inference with respect to arbitrary junction trees. Exact inference is a key problem in exploring probabilistic graphical...
135
Voted
TPDS
2010
15 years 19 days ago
2010
The objective of this paper is to extend, in the context of multicore architectures, the concepts of tile algorithms [Buttari et al., 2007] for Cholesky, LU, QR factorizations to t...
166
click to vote
AI
2011
Springer
14 years 5 months ago
2011
Springer
Probabilistic inference in graphical models is a prevalent task in statistics and artificial intelligence. The ability to perform this inference task efficiently is critical in l...
109
Voted
SIAMCO
2010
15 years 20 days ago
2010
A parallel splitting method is proposed for solving systems of coupled monotone inclusions in Hilbert spaces, and its convergence is established under the assumption that solutions...
161
Voted
CORR
2012
Springer
13 years 10 months ago
2012
Springer
Compiling Bayesian networks (BNs) to junction trees and performing belief propagation over them is among the most prominent approaches to computing posteriors in BNs. However, bel...