423 search results - page 53 / 85 » The Generalization of Generalized Automata: Expression Autom... |
144
click to vote
ICML
2004
IEEE
16 years 5 months ago
2004
IEEE
Many applications in text and speech processing require the analysis of distributions of variable-length sequences. We recently introduced a general kernel framework, rational ker...
120
click to vote
FMSD
2007
15 years 4 months ago
2007
In the classical framework of formal languages, a refinement n is modeled by a substitution and an abstraction by an inverse substitution. These mechanisms have been widely studie...
146
Voted
IJFCS
2002
15 years 4 months ago
2002
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
161
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
—We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints...
111
click to vote
ICCD
2000
IEEE
16 years 1 months ago
2000
IEEE
This paper presents a very general, exact technique for scheduling looping data-flow graphs. In contrast to the conventional technique using loop iteration variables and integer ...