12 search results - page 2 / 3 » Learning Probabilistic Automata with Variable Memory Length |
ICML
2005
IEEE
14 years 11 months ago
2005
IEEE
This paper explores the issue of recognizing, generalizing and reproducing arbitrary gestures. We aim at extracting a representation that encapsulates only the key aspects of the ...
NIPS
1993
14 years 5 days ago
1993
We propose a learning algorithm for a variable memory length Markov process. Human communication, whether given as text, handwriting, or speech, has multi characteristic time scal...
ICGI
2010
Springer
13 years 9 months ago
2010
Springer
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
TSMC
2002
13 years 10 months ago
2002
Abstract--We present the STack ARchitecture (STAR) automaton. It is a fixed structure, multiaction, reward-penalty learning automaton, characterized by a star-shaped state transiti...
ISBI
2008
IEEE
14 years 11 months ago
2008
IEEE
In this work we present a novel approach for learning nonhomogenous textures without facing the unlearning problem. Our learning method mimics the human behavior of selective lear...