Sciweavers

557 search results - page 13 / 112
» On the convergence time of distributed quantized averaging a...
Sort
View
UAI
2003
13 years 9 months ago
On the Convergence of Bound Optimization Algorithms
Many practitioners who use EM and related algorithms complain that they are sometimes slow. When does this happen, and what can be done about it? In this paper, we study the gener...
Ruslan Salakhutdinov, Sam T. Roweis, Zoubin Ghahra...
ISAAC
1998
Springer
66views Algorithms» more  ISAAC 1998»
13 years 12 months ago
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
Josep Díaz, Jordi Petit, Panagiotis Psychar...
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
13 years 9 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
SPIRE
1999
Springer
13 years 12 months ago
Linear Time Sorting of Skewed Distributions
This work presents an e cient linear average time algorithm to sort lists of integers that follow skewed distributions. It also studies a particular case where the list follows th...
Edleno Silva de Moura, Gonzalo Navarro, Nivio Zivi...
TSP
2008
100views more  TSP 2008»
13 years 7 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....