Analysis of the Min-Sum Algorithm for Packing and Covering Problems via Linear Programming

Message-passing algorithms based on belief-propagation (BP) are successfully used in many applications, including decoding error correcting codes and solving constraint satisfaction and inference problems. The BP-based algorithms operate over graph representations, called factor graphs, that are use...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on information theory Ročník 61; číslo 10; s. 5295 - 5305
Hlavní autoři:	Even, Guy, Halabi, Nissim
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York IEEE 01.10.2015 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithms belief propagation (BP) Bipartite graph combinatorial optimization covering problems Dynamic programming Errors factor graphs graph cover Heuristic algorithms Inference algorithms Linear programming linear programming (LP) Matrix max-product algorithm message-passing algorithms min-sum algorithm Optimization Oscillators packing problems Variables Vector space max-product algorithm combinatorial optimization graph cover Belief propagation (BP) min-sum algorithm dynamic programming factor graphs covering problems linear programming (LP) message-passing algorithms packing problems
ISSN:	0018-9448, 1557-9654
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!