219 citations · 1.8k across the 99 of their papers we have counts for
1 paper · 1 filter
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…