297 search results - page 33 / 60 » Every Sequence Is Decompressible from a Random One |
109
click to vote
CEC
2003
IEEE
15 years 2 months ago
2003
IEEE
Abstract- Complex systems techniques provide a powerful tool to study the emergent properties of networks of interacting genes. In this study we extract models of genetic regulator...
82
Voted
GD
1998
Springer
15 years 3 months ago
1998
Springer
We consider the problem of visualizing interconnections in railway systems. Given time tables from systems with thousands of trains, we are to visualize basic properties of the co...
DOCENG
2003
ACM
15 years 4 months ago
2003
ACM
We introduce a lazy XSLT interpreter that provides random access to the transformation result. This allows efficient pipelining of transformation sequences. Nodes of the result tr...
IJNSEC
2008
14 years 11 months ago
2008
Current anonymous systems either use a small, fixed core set of mixes or randomly choose a sequence of peer nodes to form anonymous paths/tunnels. The resulting paths are fragile ...
NC
2007
14 years 10 months ago
2007
Abstract. We study latching dynamics, i.e. the ability of a network to hop spontaneously from one discrete attractor state to another, which has been proposed as a model of an inï¬...