64 citations · 285 across the 26 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2013★ 7 cited
On MAP Inference by MWSS on Perfect Graphs
Adrian Weller, Tony S. Jebara
Finding the most likely (MAP) configuration of a Markov random field (MRF) is NP-hard in general. A promising, recent technique is to reduce the problem to finding a maximum weight…
cs.AI2012★ 22 cited
MAP Estimation, Message Passing, and Perfect Graphs
Tony S. Jebara
Efficiently finding the maximum a posteriori (MAP) configuration of a graphical model is an important problem which is often implemented using message passing algorithms. The optim…