8 search results - page 2 / 2 » Efficient belief propagation for higher-order cliques using ... |
UAI
2008
13 years 7 months ago
2008
Linear Programming (LP) relaxations have become powerful tools for finding the most probable (MAP) configuration in graphical models. These relaxations can be solved efficiently u...
TSP
2008
13 years 6 months ago
2008
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
KDD
2009
ACM
14 years 6 months ago
2009
ACM
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...