9 search results - page 1 / 2 » Shift Equivalence of P-finite Sequences |
COMBINATORICS
2006
13 years 7 months ago
2006
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...
ECCV
2008
Springer
14 years 9 months ago
2008
Springer
Video streams are ubiquitous in applications such as surveillance, games, and live broadcast. Processing and analyzing these data is challenging because algorithms have to be effic...
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
— Non-Linear Feedback Shift Registers (NLFSRs) have been proposed as an alternative to Linear Feedback Shift Registers (LFSRs) for generating pseudo-random sequences for stream c...
SETA
2010
Springer
13 years 5 months ago
2010
Springer
A Hadamard matrix is said to be completely non-cyclic (CNC) if there are no two rows (or two columns) that are shift equivalent in its reduced form. In this paper, we present three...
CPAIOR
2009
Springer
14 years 2 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...