Sciweavers

328 search results - page 20 / 66
» Deterministic k-set structure
Sort
View
FSTTCS
2010
Springer
13 years 5 months ago
Parityizing Rabin and Streett
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...
Udi Boker, Orna Kupferman, Avital Steinitz
NAACL
2007
13 years 8 months ago
Incremental Non-Projective Dependency Parsing
An open issue in data-driven dependency parsing is how to handle non-projective dependencies, which seem to be required by linguistically adequate representations, but which pose ...
Joakim Nivre
TSMC
2002
98views more  TSMC 2002»
13 years 7 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
ITC
2000
IEEE
84views Hardware» more  ITC 2000»
13 years 11 months ago
Non-intrusive BIST for systems-on-a-chip
1 The term "functional BIST" describes a test method to control functional modules so that they generate a deterministic test set, which targets structural faults within ...
Silvia Chiusano, Paolo Prinetto, Hans-Joachim Wund...
FSTTCS
2010
Springer
13 years 5 months ago
Generalizing the powerset construction, coalgebraically
a is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor F determines both the type of systems (F-coalgebras) and a notion of behav...
Alexandra Silva, Filippo Bonchi, Marcello M. Bonsa...