Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation.
Lukas KrocAshish SabharwalBart SelmanPublished in: NIPS (2008)
Keyphrases
- belief propagation
- graphical models
- message passing
- graph cuts
- markov random field
- approximate inference
- stereo matching
- graph coloring problems
- clustering algorithm
- factor graphs
- fixed point
- energy minimization
- loopy belief propagation
- constraint satisfaction problems
- pairwise
- scheduling problem
- markov networks
- energy function
- optimal solution
- three dimensional
- data clustering
- satisfiability problem
- probabilistic inference
- high quality
- parameter estimation
- maximum likelihood