Sciweavers

Share
ICASSP
2011
IEEE
9 years 3 months ago
Multi-sensor estimation and detection of phase-locked sinusoids
This paper proposes a method to compute the likelihood function for the amplitudes and phase shifts of noisily observed phase-locked and amplitude-constrained sinusoids. The sinus...
Christoph Reller, Hans-Andrea Loeliger, Stefano Ma...
TIT
2010
170views Education» more  TIT 2010»
9 years 6 months ago
Belief propagation estimation of protein and domain interactions using the sum-product algorithm
We present a novel framework to estimate protein-protein (PPI) and domain-domain (DDI) interactions based on a belief propagation estimation method that efficiently computes inter...
Faruck Morcos, Marcin Sikora, Mark S. Alber, Dale ...
CORR
2011
Springer
165views Education» more  CORR 2011»
9 years 6 months ago
Partition Functions of Normal Factor Graphs
—One of the most common types of functions in mathematics, physics, and engineering is a sum of products, sometimes called a partition function. After “normalization,” a sum ...
G. David Forney Jr., Pascal O. Vontobel
AI
2011
Springer
9 years 6 months ago
Bounded approximate decentralised coordination via the max-sum algorithm
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
Alex Rogers, Alessandro Farinelli, Ruben Stranders...
CORR
2010
Springer
158views Education» more  CORR 2010»
9 years 8 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
2006
Springer
121views Education» more  CORR 2006»
9 years 12 months ago
Loop series for discrete statistical models on graphs
In this paper we present the derivation details, logic, and motivation for the three loop calculus introduced in Chertkov and Chernyak (2006 Phys. Rev. E 73 065102(R)). Generating ...
Michael Chertkov, Vladimir Y. Chernyak
NIPS
2008
10 years 1 months ago
Bounds on marginal probability distributions
We propose a novel bound on single-variable marginal probability distributions in factor graphs with discrete variables. The bound is obtained by propagating local bounds (convex ...
Joris M. Mooij, Hilbert J. Kappen
NIPS
2008
10 years 1 months ago
Counting Solution Clusters in Graph Coloring Problems Using Belief Propagation
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
Lukas Kroc, Ashish Sabharwal, Bart Selman
INFOCOM
2007
IEEE
10 years 6 months ago
Performance Evaluation of Loss Networks via Factor Graphs and the Sum-Product Algorithm
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...
Jian Ni, Sekhar Tatikonda
ICC
2007
IEEE
192views Communications» more  ICC 2007»
10 years 6 months ago
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
Andres I. Vila Casado, Miguel Griot, Richard D. We...
books