238 search results - page 7 / 48 » Learning Recursive Automata from Positive Examples |
VMV
2008
13 years 9 months ago
2008
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
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...
IEAAIE
2001
Springer
13 years 12 months ago
2001
Springer
The growing availability of online text has lead to an increase in the use of automatic knowledge acquisition approaches from textual data, as in Information Extraction (IE). Some ...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Nested words are a restriction of the class of visibly pushdown languages that provide a natural model of runs of programs with recursive procedure calls. The usual conne...
OOPSLA
2009
Springer
14 years 1 days ago
2009
Springer
The “Killer Examples” series of workshops are highly interactive workshops which have been an annual occurrence at OOPSLA since 2002. The goals of the workshop are to bring to...