Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function.
Alexander D. ScottGregory B. SorkinPublished in: ACM Trans. Algorithms (2009)
Keyphrases
- partition function
- constraint satisfaction problems
- markov random field
- constraint satisfaction
- upper bound
- closed form
- approximate inference
- belief propagation
- random fields
- importance sampling
- structured prediction
- upper and lower bounds
- parameter estimation
- probability density function
- constraint propagation
- bayesian framework
- np complete
- search space
- constraint graph
- graphical models
- maximum likelihood estimation
- graph structure
- constraint programming
- np hard
- lower bound
- arc consistency
- structure learning
- global constraints
- graph theory
- directed acyclic graph
- maximum likelihood
- directed graph
- conditional random fields
- graph cuts
- exponential family
- monte carlo
- stereo matching
- random variables
- bayesian networks
- loopy belief propagation
- prior knowledge
- bounded treewidth
- latent variables