1972 search results - page 193 / 395 » Hidden semi-Markov models |
235
click to vote
ECML
1998
Springer
15 years 11 months ago
1998
Springer
Previous bias shift approaches to predicate invention are not applicable to learning from positive examples only, if a complete hypothesis can be found in the given language, as ne...
209
click to vote
IPCV
2008
15 years 8 months ago
2008
- Automatic recognition of spoken digits is one of the difficult tasks in the field of computer speech recognition. Spoken digits recognition process is required in many applicatio...
214
click to vote
FORTE
2004
15 years 8 months ago
2004
Abstract. Monitoring large distributed concurrent systems is a challenging task. In this paper we formulate (model-based) diagnosis by means of hidden state history reconstruction,...
199
click to vote
UAI
2004
15 years 8 months ago
2004
We propose dynamical systems trees (DSTs) as a flexible model for describing multiple processes that interact via a hierarchy of aggregating processes. DSTs extend nonlinear dynam...
229
click to vote
IJCAI
1997
15 years 8 months ago
1997
cal maps provide a useful abstraction for robotic navigation and planning. Although stochastic mapscan theoreticallybe learned using the Baum-Welch algorithm,without strong prior ...