Sciweavers

557 search results - page 19 / 112
» On the convergence time of distributed quantized averaging a...
Sort
View
STOC
1989
ACM
117views Algorithms» more  STOC 1989»
13 years 11 months ago
On the Theory of Average Case Complexity
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
Shai Ben-David, Benny Chor, Oded Goldreich, Michae...
TIT
2008
103views more  TIT 2008»
13 years 7 months ago
Fast Distributed Algorithms for Computing Separable Functions
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
Damon Mosk-Aoyama, Devavrat Shah
IPPS
2007
IEEE
14 years 1 months ago
Using Linearization for Global Consistency in SSR
Novel routing algorithms such as scalable source routing (SSR) and virtual ring routing (VRR) need to set up and maintain a virtual ring structure among all the nodes in the netwo...
Kendy Kutzner, Thomas Fuhrmann
GLOBECOM
2007
IEEE
14 years 2 months ago
Initialization Techniques for Improved Convergence of LMS DFEs in Strong Interference Environments
— The least-mean square (LMS) decision-feedback equalizer (DFE) was previously shown [1], [2] to possess an extended convergence time in an interference limited environment. In [...
Arun Batra, James R. Zeidler, Aloysius A. Beex
ICA
2012
Springer
12 years 3 months ago
New Online EM Algorithms for General Hidden Markov Models. Application to the SLAM Problem
In this contribution, new online EM algorithms are proposed to perform inference in general hidden Markov models. These algorithms update the parameter at some deterministic times ...
Sylvain Le Corff, Gersende Fort, Eric Moulines