Sciweavers

212 search results - page 7 / 43
» On Lengths of Rainbow Cycles
Sort
View
IPPS
2003
IEEE
14 years 2 months ago
Improving Speculative Thread-Level Parallelism Through Module Run-Length Prediction
Exploiting speculative thread-level parallelism across modules, e.g., methods, procedures, or functions, have shown promise. However, misspeculations and task creation overhead ar...
Fredrik Warg, Per Stenström
ECCV
2006
Springer
14 years 11 months ago
Cyclostationary Processes on Shape Spaces for Gait-Based Recognition
Abstract. We present a geometric and statistical approach to gaitbased human recognition. The novelty here is to consider observations of gait, considered as planar silhouettes, to...
David Kaziska, Anuj Srivastava
IACR
2011
91views more  IACR 2011»
12 years 9 months ago
A Scalable Method for Constructing Galois NLFSRs with Period $2^n-1$ using Cross-Join Pairs
This paper presents a method for constructing n-stage Galois NLFSRs with period 2n − 1 from n-stage maximum length LFSRs. We introduce nonlinearity into state cycles by adding a ...
Elena Dubrova
WAOA
2005
Springer
170views Algorithms» more  WAOA 2005»
14 years 3 months ago
On Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
Bodo Manthey
COCOON
2003
Springer
14 years 2 months ago
Fault-Hamiltonicity of Product Graph of Path and Cycle
We investigate hamiltonian properties of Pm × Cn, m ≥ 2 and even n ≥ 4, which is bipartite, in the presence of faulty vertices and/or edges. We show that Pm×Cn with n even is...
Jung-Heum Park, Hee-Chul Kim