Sciweavers

2 search results - page 1 / 1
» Counting in Graph Covers: A Combinatorial Characterization o...
Sort
View
CORR
2010
Springer
158views Education» more  CORR 2010»
13 years 1 months ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel
CORR
2011
Springer
215views Education» more  CORR 2011»
12 years 8 months ago
The Bethe Permanent of a Non-Negative Matrix
:  The Bethe Permanent of a Non-Negative Matrix Pascal O. Vontobel HP Laboratories HPL-2011-116 Bethe approximation; Bethe permanent; graph cover; partition function; perfect ma...
Pascal O. Vontobel