1279 search results - page 8 / 256 » Fast Implementations of Automata Computations |
IPPS
2000
IEEE
13 years 12 months ago
2000
IEEE
This paper presents a new superscalar architecture for fast discrete cosine transform (DCT). Comparing with the general SIMD architecture, it speeds up the DCT computation by a fac...
EUROCAST
2001
Springer
13 years 12 months ago
2001
Springer
CAST.FSM denotes a CAST tool which has been developed at the Institute of Systems Science at the University of Linz during the years 1986-1993. The first version of CAST.FSM was i...
122
click to vote
Tutorial
This technical report discusses Sethian's Fast Marching Method and its higher accuracy variant. Both methods may be used to compute the arrival times at the points of a discre...
LICS
2003
IEEE
14 years 23 days ago
2003
IEEE
We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to d...
IPPS
2002
IEEE
14 years 13 days ago
2002
IEEE
This paper presents a self-adapting parallel package for computing the Walsh-Hadamard transform (WHT), a prototypical fast signal transform, similar to the fast Fourier transform....