Oct 24, 2008 · Abstract: We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, ...

Abstract. We present polynomial-time algorithms for the exact computation of lowest- energy states, worst margin violators, partition functions, and marginals ...

We give polynomial-time algorithms for the exact computation of lowest-energy states, worst margin violators, partition functions, and marginals in certain ...

We give polynomial-time algorithms for the exact computation of lowest-energy states, worst margin violators, partition functions, and marginals in certain ...

The approach provides an interesting alternative to the well-known graph cut paradigm in that it does not impose any submodularity constraints; ...

The algorithm is popular because it allows the user to compute the free energy quite accurately and at the same time determine the energy and configuration of ...

Our approach provides an interesting alternative to the well-known graph cut paradigm in that it does not impose any submodularity constraints; instead we ...

Oct 24, 2008 · We give polynomial-time algorithms for the exact computation of lowest-energy (ground) states, worst margin violators, partition functions, ...

Thus, inference of the zero-field planar Ising model is tractable and scales well with problem size. The gradient and Hessian of the log-partition function Φ(θ) ...