397 search results - page 6 / 80 » Learning Relational Grammars from Sequences of Actions |
LICS
1991
IEEE
15 years 1 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
IDA
2007
Springer
14 years 9 months ago
2007
Springer
Graph grammars combine the relational aspect of graphs with the iterative and recursive aspects of string grammars, and thus represent an important next step in our ability to dis...
MICAI
2009
Springer
15 years 4 months ago
2009
Springer
Reinforcement Learning is a commonly used technique in robotics, however, traditional algorithms are unable to handle large amounts of data coming from the robot’s sensors, requi...
83
Voted
AIED
2005
Springer
15 years 3 months ago
2005
Springer
This paper describes an approach for analysis of computer-supported learning processes utilizing logfiles of learners’ actions. We provide help to researchers and teachers in ...
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
Summarizing the contents of a video containing human activities is an important problem in computer vision and has important applications in automated surveillance systems. Summar...