Sciweavers

682 search results - page 36 / 137
» One-Counter Markov Decision Processes
Sort
View
ICASSP
2009
IEEE
15 years 6 months ago
Experimenting with a global decision tree for state clustering in automatic speech recognition systems
In modern automatic speech recognition systems, it is standard practice to cluster several logical hidden Markov model states into one physical, clustered state. Typically, the cl...
Jasha Droppo, Alex Acero
ICTAI
1996
IEEE
15 years 4 months ago
Incremental Markov-Model Planning
This paper presents an approach to building plans using partially observable Markov decision processes. The approach begins with a base solution that assumes full observability. T...
Richard Washington
PE
2011
Springer
214views Optimization» more  PE 2011»
14 years 6 months ago
Time-bounded reachability in tree-structured QBDs by abstraction
Structured QBDs by Abstraction Daniel Klink, Anne Remke, Boudewijn R. Haverkort, Fellow, IEEE, and Joost-Pieter Katoen, Member, IEEE Computer Society —This paper studies quantita...
Daniel Klink, Anne Remke, Boudewijn R. Haverkort, ...
KDD
2010
ACM
282views Data Mining» more  KDD 2010»
15 years 3 months ago
Optimizing debt collections using constrained reinforcement learning
In this paper, we propose and develop a novel approach to the problem of optimally managing the tax, and more generally debt, collections processes at financial institutions. Our...
Naoki Abe, Prem Melville, Cezar Pendus, Chandan K....
EMMCVPR
2001
Springer
15 years 4 months ago
A Hierarchical Markov Random Field Model for Figure-Ground Segregation
To segregate overlapping objects into depth layers requires the integration of local occlusion cues distributed over the entire image into a global percept. We propose to model thi...
Stella X. Yu, Tai Sing Lee, Takeo Kanade