1279 search results - page 73 / 256 » Fast Implementations of Automata Computations |
PAMI
2007
13 years 7 months ago
2007
—We have previously developed a neurodynamical model of motion segregation in cortical visual area V1 and MT of the dorsal stream. The model explains how motion ambiguities cause...
AIPS
2010
13 years 10 months ago
2010
Factored planning methods aim to exploit locality to efficiently solve large but "loosely coupled" planning problems by computing solutions locally and propagating limit...
DLT
2003
13 years 9 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
ARITH
2005
IEEE
13 years 9 months ago
2005
IEEE
This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of both 2-D Discrete Cosine Transform and Inverse DCT. The architecture uses a...
CLUSTER
2000
IEEE
13 years 11 months ago
2000
IEEE
This paper introduces MadeleineII, a new adaptive and portable multi-protocol implementation of the Madeleine communication library. MadeleineII has the ability to control multipl...