ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
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...
TIT
2010
12 years 11 months ago
2010
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...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
—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 ...
AI
2011
Springer
12 years 11 months ago
2011
Springer
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...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
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...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
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 ...
NIPS
2008
13 years 5 months ago
2008
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 ...
NIPS
2008
13 years 5 months ago
2008
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...
INFOCOM
2007
IEEE
13 years 10 months ago
2007
IEEE
— 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...
ICC
2007
IEEE
13 years 10 months ago
2007
IEEE
— 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...