Sciweavers

22 search results - page 1 / 5
» Serial Schedules for Belief-Propagation: Analysis of Converg...
Sort
View
TIT
2008
129views more  TIT 2008»
13 years 3 months ago
Serial Schedules for Belief-Propagation: Analysis of Convergence Time
Abstract--Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation algorithm over the factor graph of the code. In the traditional messa...
Jacob Goldberger, Haggai Kfir
GECCO
2007
Springer
201views Optimization» more  GECCO 2007»
13 years 9 months ago
A parallel framework for loopy belief propagation
There are many innovative proposals introduced in the literature under the evolutionary computation field, from which estimation of distribution algorithms (EDAs) is one of them....
Alexander Mendiburu, Roberto Santana, Jose Antonio...
TSP
2008
151views more  TSP 2008»
13 years 3 months ago
Convergence Analysis of Reweighted Sum-Product Algorithms
Markov random fields are designed to represent structured dependencies among large collections of random variables, and are well-suited to capture the structure of real-world sign...
Tanya Roosta, Martin J. Wainwright, Shankar S. Sas...
INFOCOM
2007
IEEE
13 years 10 months ago
Iterative Scheduling Algorithms
— The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switc...
Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Ma...
ECCV
2008
Springer
14 years 1 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee