1279 search results - page 10 / 256 » Fast Implementations of Automata Computations |
CLUSTER
2003
IEEE
14 years 24 days ago
2003
IEEE
Extendible hashing is a kind of fast indexing technology; it provides with a way of storing structural data records so that each of them can be gotten very quickly. In this paper,...
RECONFIG
2008
IEEE
14 years 1 months ago
2008
IEEE
In the context of the emergence of alternative computing resources to address the challenge of the upcoming end of Moore’s law, we consider the feasibility of gathering computat...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
The Smith-Waterman (SW) algorithm is one of the widely used algorithms for sequence alignment in computational biology. With the growing size of the sequence database, there is alw...
CATA
2003
13 years 9 months ago
2003
Binary morphological operations are a building block in many computer vision applications. Several iterative morphological operations are commonly performed for image analysis res...
ECAL
1999
Springer
13 years 11 months ago
1999
Springer
In this paper, we present a possible implementation of arithmetic functions (notably, addition and multiplication) using self-replicating cellular automata. The operations are per...