3 citations · 3 across the 1 of their papers we have counts for
1 paper
Adrian Weller, Tony Jebara
Inference in general Markov random fields (MRFs) is NP-hard, though identifying the maximum a posteriori (MAP) configuration of pairwise MRFs with submodular cost functions is effi…