Sciweavers

539 search results - page 17 / 108
» Linear complexity of transformed sequences
Sort
View
CTRSA
2009
Springer
155views Cryptology» more  CTRSA 2009»
15 years 4 months ago
Cryptanalysis of CTC2
CTC is a toy cipher designed in order to assess the strength of algebraic attacks. While the structure of CTC is deliberately weak with respect to algebraic attacks, it was claimed...
Orr Dunkelman, Nathan Keller
CVPR
2010
IEEE
1192views Computer Vision» more  CVPR 2010»
15 years 6 months ago
RASL: Robust Alignment by Sparse and Low-rank Decomposition for Linearly Correlated Images
This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of im...
Yigang Peng, Arvind Balasubramanian, John Wright, ...
DATE
2009
IEEE
141views Hardware» more  DATE 2009»
15 years 4 months ago
How to speed-up your NLFSR-based stream cipher
— 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...
Elena Dubrova
ICPR
2002
IEEE
15 years 10 months ago
Multi-Scale Autoconvolution for Affine Invariant Pattern Recognition
This paper describes a novel image transform called Multi-Scale Autoconvolution which is invariant with respect to affine transformations of the spatial image coordinates. The tra...
Janne Heikkilä
CIKM
1998
Springer
15 years 1 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki