11716 search results - page 397 / 2344 » Computable symbolic dynamics |
164
click to vote
ACSC
2002
IEEE
15 years 11 months ago
2002
IEEE
The Block Sorting process of Burrows and Wheeler can be applied to any sequence in which symbols are (or might be) conditioned upon each other. In particular, it is possible to pa...
161
click to vote
CLUSTER
2002
IEEE
15 years 11 months ago
2002
IEEE
Supermon is a flexible set of tools for high speed, scalable cluster monitoring. Node behavior can be monitored much faster than with other commonly used methods (e.g., rstatd). ...
160
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
The de Bruijn digraph B d;D is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left shift permutation on the words, after which the rightmos...
164
click to vote
DAC
1996
ACM
15 years 11 months ago
1996
ACM
PPP is a Web-based simulation and synthesis environment for low-power design. In this paper we describe the gate-level simulation engine of PPP, that achieves accuracy always with...
198
click to vote
DCC
1992
IEEE
15 years 11 months ago
1992
IEEE
Text compression algorithms are normally defined in terms of a source alphabet of 8-bit ASCII codes. We consider choosing to be an alphabet whose symbols are the words of Englis...