2996 search results - page 91 / 600 » Numberings and Randomness |
88
Voted
WEA
2007
Springer
15 years 6 months ago
2007
Springer
Given a sequence S of n symbols over some alphabet Σ, we develop a new compression method that is (i) very simple to implement; (ii) provides O(1) time random access to any symbol...
102
Voted
ECAL
2003
Springer
15 years 6 months ago
2003
Springer
Abstract. We propose the use of Deterministic Generalized Asynchronous Random Boolean Networks [1] as models of contextual deterministic discrete dynamical systems. We show that ch...
100
click to vote
CMSB
2006
Springer
15 years 4 months ago
2006
Springer
Having in mind the large-scale analysis of gene regulatory networks, we review a graph decimation algorithm, called "leaf-removal", which can be used to evaluate the feed...
108
click to vote
DNA
2000
Springer
15 years 4 months ago
2000
Springer
We present a randomized DNA algorithm for k-SAT based on the classical algorithm of Paturi et al. [8]. For an n-variable, m-clause instance of k-SAT (m > n), our algorithm finds...
101
click to vote
DM
2008
15 years 23 days ago
2008
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...