212 search results - page 6 / 43 » On Lengths of Rainbow Cycles |
COCOON
2010
Springer
14 years 2 months ago
2010
Springer
A universal cycle for the k-permutations of n = {1, 2, ..., n} is a circular string of length nk that contains each k-permutation exactly once as a substring. Jackson (Discrete Mat...
EJC
2010
13 years 9 months ago
2010
Say a digraph is k-free if it has no directed cycles of length at most k, for k Z+ . Thomass
ICRA
2009
IEEE
14 years 4 months ago
2009
IEEE
Abstract— In this paper we describe an algorithm to compute cycle constraints that can be used in many graph-based SLAM algorithms; we exemplify it in Hierarchical SLAM. Our algo...
FSE
2005
Springer
14 years 3 months ago
2005
Springer
T-function is a relatively new cryptographic building block suitable for streamciphers. It has the potential of becoming a substitute for LFSRs, and those that correspond to maximu...
ICCD
2002
IEEE
14 years 6 months ago
2002
IEEE
In this paper, a parallel Variable-Length Decoding (VLD) scheme is introduced. The scheme is capable of decoding all the codewords in an N-bit buffer whose accumulated codelength ...