Sciweavers

286 search results - page 25 / 58
» A Markov Chain Model of the B-Cell Algorithm
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
SAC
2008
ACM
13 years 7 months ago
Particle methods for maximum likelihood estimation in latent variable models
Standard methods for maximum likelihood parameter estimation in latent variable models rely on the Expectation-Maximization algorithm and its Monte Carlo variants. Our approach is ...
Adam M. Johansen, Arnaud Doucet, Manuel Davy
VALUETOOLS
2006
ACM
164views Hardware» more  VALUETOOLS 2006»
14 years 1 months ago
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs
High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a co...
Kai Lampka, Markus Siegle
ICASSP
2011
IEEE
12 years 11 months ago
Bayesian Compressive Sensing for clustered sparse signals
In traditional framework of Compressive Sensing (CS), only sparse prior on the property of signals in time or frequency domain is adopted to guarantee the exact inverse recovery. ...
Lei Yu, Hong Sun, Jean-Pierre Barbot, Gang Zheng
CSDA
2008
91views more  CSDA 2008»
13 years 7 months ago
Model-based clustering for longitudinal data
A model-based clustering method is proposed for clustering individuals on the basis of measurements taken over time. Data variability is taken into account through non-linear hier...
Rolando De la Cruz-Mesía, Fernando A. Quint...