Sciweavers

515 search results - page 9 / 103
» Approximating Markov Processes by Averaging
Sort
View
ICPR
2008
IEEE
14 years 8 months ago
Approximating a non-homogeneous HMM with Dynamic Spatial Dirichlet Process
In this work we present a model that uses a Dirichlet Process (DP) with a dynamic spatial constraints to approximate a non-homogeneous hidden Markov model (NHMM). The coefficient ...
Haijun Ren, Leon N. Cooper, Liang Wu, Predrag Nesk...
ICASSP
2008
IEEE
14 years 1 months ago
Generalized Gaussian Markov random field image restoration using variational distribution approximation
In this paper we propose novel algorithms for image restoration and parameter estimation with a Generalized Gaussian Markov Random Field prior utilizing variational distribution a...
S. Derin Babacan, Rafael Molina, Aggelos K. Katsag...
WSC
2008
13 years 9 months ago
On step sizes, stochastic shortest paths, and survival probabilities in Reinforcement Learning
Reinforcement Learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the probl...
Abhijit Gosavi
ICASSP
2008
IEEE
14 years 1 months ago
Distributed average consensus in sensor networks with quantized inter-sensor communication
— The paper studies distributed average consensus in sensor networks, when the sensors exchange quantized data at each time step. We show that randomizing the exchanged sensor da...
Soummya Kar, José M. F. Moura
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 7 months ago
Mean field for Markov Decision Processes: from Discrete to Continuous Optimization
We study the convergence of Markov Decision Processes made of a large number of objects to optimization problems on ordinary differential equations (ODE). We show that the optimal...
Nicolas Gast, Bruno Gaujal, Jean-Yves Le Boudec