198 search results - page 30 / 40 » Learning Unary Automata |
WCRE
2007
IEEE
14 years 1 months ago
2007
IEEE
Dynamic protocol recovery tries to recover a component’s sequencing constraints by means of dynamic analysis. This problem has been tackled by several automaton learning approac...
PKC
2010
Springer
13 years 9 months ago
2010
Springer
This paper presents an efficient protocol for securely computing the fundamental problem of pattern matching. This problem is defined in the two-party setting, where party P1 hold...
IJON
2007
13 years 7 months ago
2007
We focus on how infants’ discovery of a range of affordances and effectivities contributes to participating in a new activity. We emphasize how caregivers bracket ongoing action...
TSMC
2002
13 years 7 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...
ICML
2009
IEEE
14 years 2 months ago
2009
IEEE
One of the main problems in probabilistic grammatical inference consists in inferring a stochastic language, i.e. a probability distribution, in some class of probabilistic models...