Sciweavers

515 search results - page 13 / 103
» Approximating Markov Processes by Averaging
Sort
View
NA
2007
80views more  NA 2007»
13 years 7 months ago
Image reconstruction by OPED algorithm with averaging
Abstract. OPED is a new image reconstruction algorithm based on orthogonal polynomial expansion on the disk. We show that the integral of the approximation function in OPED can be ...
Yuan Xu, Oleg Tischenko, Christoph Hoeschen
SIGMETRICS
2000
ACM
105views Hardware» more  SIGMETRICS 2000»
13 years 11 months ago
Using the exact state space of a Markov model to compute approximate stationary measures
We present a new approximation algorithm based on an exact representation of the state space S, using decision diagrams, and of the transition rate matrix R, using Kronecker algeb...
Andrew S. Miner, Gianfranco Ciardo, Susanna Donate...
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
QEST
2006
IEEE
14 years 1 months ago
Limiting Behavior of Markov Chains with Eager Attractors
We consider discrete infinite-state Markov chains which contain an eager finite attractor. A finite attractor is a finite subset of states that is eventually reached with prob...
Parosh Aziz Abdulla, Noomene Ben Henda, Richard Ma...
ICML
1999
IEEE
14 years 8 months ago
Monte Carlo Hidden Markov Models: Learning Non-Parametric Models of Partially Observable Stochastic Processes
We present a learning algorithm for non-parametric hidden Markov models with continuous state and observation spaces. All necessary probability densities are approximated using sa...
Sebastian Thrun, John Langford, Dieter Fox