198 search results - page 23 / 40 » Learning Unary Automata |
FGR
2011
IEEE
12 years 11 months ago
2011
IEEE
— Matching images with large geometric and iconic changes (e.g. faces under different poses and facial expressions) is an open research problem in computer vision. There are two ...
TCS
2008
13 years 7 months ago
2008
This paper studies a novel paradigm for learning formal languages from positive and negative examples which consists of mapping strings to an appropriate highdimensional feature s...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we survey some results in inductive inference showing how learnability of a class of languages may depend on hypothesis space chosen. We also discuss results which co...
ICGI
2010
Springer
13 years 5 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...
COLT
1994
Springer
13 years 11 months ago
1994
Springer
: Sequential algorithms given by Angluin 1987 and Schapire 1992 learn deterministic nite automata DFA exactly from Membership and Equivalence queries. These algorithms are feasible...