2750 search results - page 5 / 550 » The complexity of learning SUBSEQ(A) |
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
ICANN
2007
Springer
13 years 11 months ago
2007
Springer
We present an artificial neural network used to learn online complex temporal sequences of gestures to a robot. The system is based on a simple temporal sequences learning architec...
JIRS
2000
13 years 7 months ago
2000
Abstract. Autonomous learning systems of significant complexity often consist of several interacting modules or agents. These modules collaborate to produce a system which, when vi...
COLT
2004
Springer
14 years 23 days ago
2004
Springer
COLT
1993
Springer
13 years 11 months ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...