1279 search results - page 191 / 256 » Fast Implementations of Automata Computations |
VISUALIZATION
1991
IEEE
14 years 1 months ago
1991
IEEE
We describe a software system, TOPO, that numerically analyzes and graphically displays topological aspects of a three dimensional vector field, v, to produce a single, relativel...
DC
2010
13 years 9 months ago
2010
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
RECOMB
2005
Springer
14 years 10 months ago
2005
Springer
We describe a novel method for efficient reconstruction of phylogenetic trees, based on sequences of whole genomes or proteomes, whose lengths may greatly vary. The core of our me...
ISMB
1994
13 years 11 months ago
1994
Homologydetection in large data bases is probably the most time consuming operation in molecular genetic computing systems. Moreover, the progresses made all around the world conc...
HASKELL
2006
ACM
14 years 3 months ago
2006
ACM
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...