Sciweavers

37 search results - page 2 / 8
» Stability Bounds for Non-i.i.d. Processes
Sort
View
SSS
2009
Springer
14 years 2 months ago
Stability of Distributed Algorithms in the Face of Incessant Faults
Abstract. For large distributed systems built from inexpensive components, one expects to see incessant failures. This paper proposes two models for such faults and analyzes two we...
Robert E. Lee DeVille, Sayan Mitra
CJ
2010
128views more  CJ 2010»
13 years 7 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...
DGCI
2003
Springer
14 years 20 days ago
Stability in Discrete Tomography: Linear Programming, Additivity and Convexity
The problem of reconstructing finite subsets of the integer lattice from X-rays has been studied in discrete mathematics and applied in several fields like image processing, data...
Sara Brunetti, Alain Daurat
ICASSP
2011
IEEE
12 years 11 months ago
On gradient type adaptive filters with non-symmetric matrix step-sizes
—In this contribution we provide a thorough stability analysis of gradient type algorithms with non-symmetric matrix step-sizes. We hereby extend existing analyses for symmetric ...
Markus Rupp
IOR
2010
92views more  IOR 2010»
13 years 6 months ago
Series Expansions for Continuous-Time Markov Processes
We present exchange formulas that allow to express the stationary distribution of a continuous Markov chain with denumerable state-space having generator matrix Q∗ through a con...
Bernd Heidergott, Arie Hordijk, Nicole Leder