![]() |
Volumn 47, Issue 2, 2001, Pages 736-744
|
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
a
IEEE
(United States)
|
Author keywords
Bayesian networks; Belief propagations; Markov random fields (MRFs); Max product; Maximum a posteriori (MAP) estimate; Min sum
|
Indexed keywords
ALGORITHMS;
GRAPH THEORY;
GRAPHIC METHODS;
MARKOV PROCESSES;
BAYESIAN NETWORKS;
BELIEF PROPAGATION;
MAXIMUM A POSTERIORI ESTIMATE;
PROBABILISTIC LOGICS;
|
EID: 0035246323
PISSN: 00189448
EISSN: None
Source Type: Journal
DOI: 10.1109/18.910585 Document Type: Article |
Times cited : (479)
|
References (23)
|