%0 Journal Article %1 Weiss2001 %A Weiss, Y %A Freeman, W T %D 2001 %J IEEE Trans. on Information Theory %K (mathematics), MRF, Markov algorithm, arbitrary assignment, belief belief-propagation codes, codesBayesian continuous-valued convergence convergence, cycle decoding, dependencies, discrete-valued distribution, equivalent fields, fixed graph graph, graphical graphs, local-message-passing max-product methods, min-sum models, networks, nodes, numerical of optimality, optimisation, performance, point,Markov posterior probability probability, processes processes, random single-loop solutions statistical topology, tree trees turbo unique %N 2 %P 736--744 %R 10.1109/18.910585 %T On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs %V 47

@article{Weiss2001, added-at = {2013-09-29T14:16:50.000+0200}, author = {Weiss, Y and Freeman, W T}, biburl = {https://www.bibsonomy.org/bibtex/230d06444fbe3a764193355bd06176b83/guillem.palou}, doi = {10.1109/18.910585}, interhash = {1508d9097af2e282e2104446caa837b0}, intrahash = {30d06444fbe3a764193355bd06176b83}, issn = {0018-9448}, journal = {IEEE Trans. on Information Theory}, keywords = {(mathematics), MRF, Markov algorithm, arbitrary assignment, belief belief-propagation codes, codesBayesian continuous-valued convergence convergence, cycle decoding, dependencies, discrete-valued distribution, equivalent fields, fixed graph graph, graphical graphs, local-message-passing max-product methods, min-sum models, networks, nodes, numerical of optimality, optimisation, performance, point,Markov posterior probability probability, processes processes, random single-loop solutions statistical topology, tree trees turbo unique}, number = 2, pages = {736--744}, timestamp = {2013-09-29T14:16:50.000+0200}, title = {{On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs}}, volume = 47, year = 2001 }