Tree Consistency and Bounds on the Performance of the Max-Product Algorithm and Its Generalizations (2002)
Cached
Download Links
by
Martin Wainwright
,
Tommi Jaakkola
,
Alan Willsky
| Citations: | 43 - 4 self |
BibTeX
@MISC{Wainwright02treeconsistency,
author = {Martin Wainwright and Tommi Jaakkola and Alan Willsky},
title = {Tree Consistency and Bounds on the Performance of the Max-Product Algorithm and Its Generalizations},
year = {2002}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Finding the maximum a posteriori (MAP) assignment of a discrete-state distribution specified by a graphical model requires solving an integer program. The max-product algorithm, also known as the max-plus or min-sum algorithm, is an iterative method for (approximately) solving such a problem on graphs with cycles.
