Sciweavers

70 search results - page 8 / 14
» Restricted Global Grammar Constraints
Sort
View
AHS
2007
IEEE
253views Hardware» more  AHS 2007»
14 years 1 months ago
evolFIR: Evolving redundancy-free FIR structures
Finite impulse response (FIR) structures are the most commonly used digital filters and can be found in various areas of everyday life. In this paper we introduce a novel approac...
Szilvia Zvada, Gabriella Kókai, Róbe...
COLING
2010
13 years 2 months ago
Forest-guided Supertagger Training
Supertagging is an important technique for deep syntactic analysis. A supertagger is usually trained independently of the parser using a sequence labeling method. This presents an...
Yao-zhong Zhang, Takuya Matsuzaki, Jun-ichi Tsujii
LATA
2009
Springer
14 years 2 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher
COLT
2005
Springer
14 years 1 months ago
Variations on U-Shaped Learning
The paper deals with the following problem: is returning to wrong conjectures necessary to achieve full power of algorithmic learning? Returning to wrong conjectures complements t...
Lorenzo Carlucci, Sanjay Jain, Efim B. Kinber, Fra...
RTS
2008
155views more  RTS 2008»
13 years 7 months ago
An EDF-based restricted-migration scheduling algorithm for multiprocessor soft real-time systems
There has been much recent interest in the use of the earliest-deadline-first (EDF) algorithm for scheduling soft real-time sporadic task systems on identical multiprocessors. In ...
James H. Anderson, Vasile Bud, UmaMaheswari C. Dev...