Sciweavers

1407 search results - page 9 / 282
» Join-Graph Propagation Algorithms
Sort
View
NIPS
2007
13 years 10 months ago
Cooled and Relaxed Survey Propagation for MRFs
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...
Hai Leong Chieu, Wee Sun Lee, Yee Whye Teh
CP
2004
Springer
14 years 2 months ago
A Domain Consistency Algorithm for the Stretch Constraint
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...
Lars Hellsten, Gilles Pesant, Peter van Beek
TIT
2010
144views Education» more  TIT 2010»
13 years 3 months ago
Lossy source compression using low-density generator matrix codes: analysis and algorithms
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...
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
14 years 3 months ago
On the stability of the Foschini-Miljanic algorithm with time-delays
— 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...
ECAI
2006
Springer
14 years 9 days ago
Improving Bound Propagation
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...
Bozhena Bidyuk, Rina Dechter