Sciweavers

49 search results - page 3 / 10
» Distributed averaging via lifted Markov chains
Sort
View
ICML
2004
IEEE
14 years 7 months ago
Approximate inference by Markov chains on union spaces
A standard method for approximating averages in probabilistic models is to construct a Markov chain in the product space of the random variables with the desired equilibrium distr...
Max Welling, Michal Rosen-Zvi, Yee Whye Teh
AUTOMATICA
2010
218views more  AUTOMATICA 2010»
13 years 7 months ago
Gossip consensus algorithms via quantized communication
This paper considers the average consensus problem on a network of digital links, and proposes algorithms based on pairwise "gossip" communications and updates. Through ...
Ruggero Carli, Fabio Fagnani, Paolo Frasca, Sandro...
ICPADS
2007
IEEE
14 years 1 months ago
Supporting deadline monotonic policy over 802.11 average service time analysis
In this paper, we propose a real time scheduling policy over 802.11 DCF protocol called Deadline Monotonic (DM). We evaluate the performance of this policy for a simple scenario w...
Inès El Korbi, Leïla Azouz Saïdan...
SODA
1998
ACM
159views Algorithms» more  SODA 1998»
13 years 8 months ago
Average-Case Analyses of First Fit and Random Fit Bin Packing
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
Susanne Albers, Michael Mitzenmacher
IVC
2008
141views more  IVC 2008»
13 years 6 months ago
Segmentation of color images via reversible jump MCMC sampling
Reversible jump Markov chain Monte Carlo (RJMCMC) is a recent method which makes it possible to construct reversible Markov chain samplers that jump between parameter subspaces of...
Zoltan Kato