2626 search results - page 23 / 526 » The complexity of stochastic sequences |
120
click to vote
CORR
2012
Springer
13 years 7 months ago
2012
Springer
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
DLT
2008
15 years 1 months ago
2008
By the famous theorem of Morse and Hedlund, a word is ultimately periodic if and only if it has bounded subword complexity, i.e., for sufficiently large n, the number of factors of...
CPM
1999
Springer
15 years 4 months ago
1999
Springer
In sequencing by hybridization (SBH), one has to reconstruct a sequence from its l-long substrings. SBH was proposed as an alternative to gel-based DNA sequencing approaches, but ...
102
click to vote
SDM
2009
SIAM
15 years 9 months ago
2009
SIAM
Mining sequential movement patterns describing group behaviour in potentially streaming spatio-temporal data sets is a challenging problem. Movements are typically noisy and often...
EUROCRYPT
1987
Springer
15 years 3 months ago
1987
Springer
Sequences with almost perfect linear complexity profile are defined by H. Niederreiter[4]. C.P. Xing and K.Y. Lam[5, 6] extended this concept from the case of single sequences to ...