We describe a new algorithm, Relaxed Survey Propagation (RSP), for finding MAP configurations in Markov random fields. We compare its performance with state-of-the-art algorith...
The stretch constraint occurs in many rostering problems that arise in the industrial and public service sectors. In this paper we present an efficient algorithm for domain consist...
We study the use of low-density generator matrix (LDGM) codes for lossy compression of the Bernoulli symmetric source. First, we establish rigorous upper bounds on the average dist...
Martin J. Wainwright, Elitza N. Maneva, Emin Marti...
— Many of the distributed power control algorithms for wireless networks in the literature ignore the fact that while the algorithms necessitate communication among users, propag...
Themistoklis Charalambous, Ioannis Lestas, Glenn V...
Abstract. This paper extends previously proposed bound propagation algorithm [11] for computing lower and upper bounds on posterior marginals in Bayesian networks. We improve the b...