Sciweavers

2626 search results - page 87 / 526
» The complexity of stochastic sequences
Sort
View
COMPLEX
2009
Springer
15 years 3 months ago
Non-sufficient Memories That Are Sufficient for Prediction
The causal states of computational mechanics define the minimal sufficient (prescient) memory for a given stationary stochastic process. They induce the -machine which is a hidden...
Wolfgang Löhr, Nihat Ay
CIBCB
2007
IEEE
15 years 6 months ago
Modeling protein-DNA binding time in Stochastic Discrete Event Simulation of Biological Processes
Abstract— This paper presents a parametric model to estimate the DNA-protein binding time using the DNA and protein structures and details of the binding site. To understand the ...
Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. ...
QEST
2010
IEEE
14 years 9 months ago
Transient Analysis of Generalised Semi-Markov Processes Using Transient Stochastic State Classes
The method of stochastic state classes approaches the analysis of Generalised Semi Markov Processes (GSMP) through symbolic derivation of probability density functions over Differe...
András Horváth, Lorenzo Ridi, Enrico...
AAECC
2002
Springer
132views Algorithms» more  AAECC 2002»
14 years 11 months ago
Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers
It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity...
Harald Niederreiter, Arne Winterhof
ICPADS
1994
IEEE
15 years 4 months ago
Stochastic Modeling of Scaled Parallel Programs
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
Allen D. Malony, Vassilis Mertsiotakis, Andreas Qu...