Universal Factor Graphs for Every NP-Hard Boolean CSP.
Shlomo JozephPublished in: APPROX-RANDOM (2014)
Keyphrases
- factor graphs
- np hard
- constraint satisfaction problems
- message passing
- graphical models
- belief propagation
- np complete
- approximate inference
- approximation algorithms
- special case
- latent variables
- lower bound
- exact inference
- optimal solution
- probabilistic inference
- worst case
- boolean functions
- probabilistic graphical models
- parameter learning
- markov random field
- markov networks
- computational complexity
- similarity measure
- cost model
- image segmentation
- search space