Sciweavers

1898 search results - page 21 / 380
» Weak Keys for IDEA
Sort
View
CRYPTO
2000
Springer
277views Cryptology» more  CRYPTO 2000»
14 years 7 days ago
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
Jürgen Bierbrauer, Holger Schellwat
IVC
2000
93views more  IVC 2000»
13 years 8 months ago
Pattern regularity as a visual key
Regular structures, flat and non-flat, are perceived as regular in a wide range of viewing angles and under varying illumination. In this papers, we exploit this simple observatio...
Dmitry Chetverikov
ICTAC
2004
Springer
14 years 2 months ago
A Proof of Weak Termination Providing the Right Way to Terminate
We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data...
Olivier Fissore, Isabelle Gnaedig, Hél&egra...
GC
2008
Springer
13 years 8 months ago
Laplacian Spectrum of Weakly Quasi-threshold Graphs
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
R. B. Bapat, A. K. Lal, Sukanta Pati
SIAMAM
2010
119views more  SIAMAM 2010»
13 years 7 months ago
The Dynamics of Weakly Reversible Population Processes near Facets
This paper concerns the dynamical behavior of weakly reversible, deterministically modeled population processes near the facets (codimension-one faces) of their invariant manifolds...
David F. Anderson, Anne Shiu