Sciweavers

258 search results - page 27 / 52
» New Lower Bounds for Heilbronn Numbers
Sort
View
INDOCRYPT
2005
Springer
15 years 3 months ago
On Highly Nonlinear S-Boxes and Their Inability to Thwart DPA Attacks
Prouff has introduced recently, at FSE 2005, the notion of transparency order of S-boxes. This new characteristic is related to the ability of an S-box, used in a cryptosystem in ...
Claude Carlet
63
Voted
COCO
2004
Springer
79views Algorithms» more  COCO 2004»
15 years 3 months ago
Relativized NP Search Problems and Propositional Proof Systems
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
Josh Buresh-Oppenheim, Tsuyoshi Morioka
ESA
2004
Springer
106views Algorithms» more  ESA 2004»
15 years 3 months ago
Stable Minimum Storage Merging by Symmetric Comparisons
We introduce a new stable minimum storage algorithm for merging that needs O(m log( n m + 1)) element comparisons, where m and n are the sizes of the input sequences with m ≤ n. ...
Pok-Son Kim, Arne Kutzner
ICALP
2001
Springer
15 years 2 months ago
Combinatorics of Periods in Strings
We consider the set Gn of all period sets of strings of length n over a finite alphabet. We show that there is redundancy in period sets and introduce the notion of an irreducibl...
Eric Rivals, Sven Rahmann
51
Voted
ICASSP
2011
IEEE
14 years 1 months ago
Improvement to esprit-type frequency estimators via reducing data redundancy
In this paper, the problem of estimating the damping factor and frequency parameters from multiple cisoids in noise is addressed. We rst propose a data matrix which generalizes th...
Weize Sun, Hing Cheung So