Sciweavers

1343 search results - page 90 / 269
» Learning Weighted Automata
Sort
View
WCRE
2007
IEEE
15 years 5 months ago
Dynamic Protocol Recovery
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...
Jochen Quante, Rainer Koschke
107
Voted
PKC
2010
Springer
118views Cryptology» more  PKC 2010»
15 years 1 months ago
Text Search Protocols with Simulation Based Security
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...
Rosario Gennaro, Carmit Hazay, Jeffrey S. Sorensen
IJON
2007
73views more  IJON 2007»
14 years 11 months ago
Affordances, effectivities, and assisted imitation: Caregivers and the directing of attention
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...
Patricia Zukow-Goldring, Michael A. Arbib
84
Voted
TSMC
2002
98views more  TSMC 2002»
14 years 10 months ago
The STAR automaton: expediency and optimality properties
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...
Anastasios A. Economides, Athanasios Kehagias
ICML
2006
IEEE
15 years 12 months ago
A statistical approach to rule learning
We present a new, statistical approach to rule learning. Doing so, we address two of the problems inherent in traditional rule learning: The computational hardness of finding rule...
Stefan Kramer, Ulrich Rückert