Sciweavers

32 search results - page 2 / 7
» Bounds on the performance of belief propagation decoding
Sort
View
JAIR
2010
130views more  JAIR 2010»
13 years 3 months ago
Join-Graph Propagation Algorithms
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...
TIT
2008
102views more  TIT 2008»
13 years 4 months ago
Average Stopping Set Weight Distributions of Redundant Random Ensembles
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
Tadashi Wadayama
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 4 months ago
Network Coding over a Noisy Relay : a Belief Propagation Approach
Abstract— In recent years, network coding has been investigated as a method to obtain improvements in wireless networks. A typical assumption of previous work is that relay nodes...
Sichao Yang, Ralf Koetter
CPAIOR
2008
Springer
13 years 6 months ago
Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting
We consider the problem of estimating the model count (number of solutions) of Boolean formulas, and present two techniques that compute estimates of these counts, as well as eith...
Lukas Kroc, Ashish Sabharwal, Bart Selman
NIPS
2004
13 years 6 months ago
Message Errors in Belief Propagation
Belief propagation (BP) is an increasingly popular method of performing approximate inference on arbitrary graphical models. At times, even further approximations are required, wh...
Alexander T. Ihler, John W. Fisher III, Alan S. Wi...