46 search results - page 3 / 10 » Permuted Longest-Common-Prefix Array |
CISS
2008
IEEE
14 years 22 days ago
2008
IEEE
—Permutations of order N are generated using polynomials in a Galois field GF(q) where q > N+1, which can be written as a linear transformation on a vector of polynomial coeff...
CISS
2008
IEEE
14 years 22 days ago
2008
IEEE
—We extend the definition of the Costas property to functions in the continuum, namely on intervals of the reals or the rationals, and argue that such functions can be used in t...
STACS
2009
Springer
14 years 1 months ago
2009
Springer
We explore various techniques to compress a permutation π over n integers, taking advantage of ordered subsequences in π, while supporting its application π(i) and the applicat...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
LRM-Trees are an elegant way to partition a sequence of values into sorted consecutive blocks, and to express the relative position of the first element of each block within a prev...
ICPR
2006
IEEE
14 years 7 months ago
2006
IEEE
Permutation ambiguity is an inherent limitation in independent component analysis, which is a bottleneck in frequency-domain methods of convolutive source separation. In this pape...