|
12
|
Efficient Exact Inference in Planar Ising Models
– Nicol N. Schraudolph, Dmitry Kamenetsky
|
|
20
|
T.: Approximate inference using planar graph decomposition
– A Globerson, Jaakkola
|
|
31
|
New outer bounds on the marginal polytope
– David Sontag, Tommi Jaakkola
- 2007
|
|
38
|
Tightening LP Relaxations for MAP using Message Passing
– David Sontag, Talya Meltzer, Amir Globerson, Tommi Jaakkola, Yair Weiss
|
|
77
|
MAP estimation via agreement on (hyper)trees: Message-passing and linear programming approaches
– Martin Wainwright, Tommi Jaakkola, Alan Willsky
- 2002
|
|
10
|
Unifying Maximum Cut and Minimum Cut of a Planar Graph
– Wei-kuan Shih, Sun Wu, Y. S. Kuo
- 1990
|
|
18
|
Beyond loose LP-relaxations: Optimizing MRFs by repairing cycles
– N Komodakis, N Paragios
- 2008
|
|
424
|
What energy functions can be minimized via graph cuts
– Vladimir Kolmogorov, Ramin Zabih
- 2004
|
|
180
|
Convergent tree-reweighted message passing for energy minimization. PAMI, 2006. et al.: Scene Text Recognition using Higher Order Language Priors 11
– V Kolmogorov
|
|
114
|
The statistics of dimers on a lattice, I., The number of dimer arrangements on a quadratic lattice, Physica 27
– P W Kasteleyn
- 1961
|
|
104
|
On the computational complexity of Ising spin glass models
– F Barahona
- 1982
|
|
268
|
Graphical models, exponential families, and variational inference. Foundations Trends
– Martin J. Wainwright, Michael I. Jordan
|
|
2
|
A simple max-cut algorithm for planar graphs
– F Liers, G Pardella
- 2008
|
|
67
|
statistics and phase transition
– Dimer P W Kasteleyn
|
|
60
|
Reverend Bayes on inference engines: A distributed hierarchical approach
– J Pearl
- 1982
|
|
82
|
Finding MAPs for belief networks is NP-hard
– S E Shimony
|
|
96
|
On the cut polytope
– F Barahona, A R Mahjoub
- 1986
|
|
84
|
Graph theory and crystal physics
– P Kasteleyn
- 1967
|
|
28
|
On the dimer solution of planar Ising models
– M E Fisher
- 1966
|
