2018 search results - page 64 / 404 » Code Normal Forms |
DLT
2010
13 years 10 months ago
2010
We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of norma...
JC
2008
13 years 10 months ago
2008
We give an upper bound in O(d(n+1)/2 ) for the number of critical points of a normal random polynomial. The number of minima (resp. maxima) is in O(d(n+1)/2 )Pn, where Pn is the (...
AAECC
2009
Springer
14 years 4 months ago
2009
Springer
We show that an affine-invariant code C of length pm is not permutation equivalent to a cyclic code except in the obvious cases: m = 1 or C is either {0}, the repetition code or it...
ICVGIP
2004
13 years 11 months ago
2004
This paper proposes a person identification system (PID), which works with non-illumination low-resolution eye images. Radial-Scan and threshold methods are used for Iris normaliz...
ICC
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract—Rateless coding ensures reliability by providing everincreasing redundancy, traditionally at the packet level (i.e. the application layer) through erasure coding. This p...