Sciweavers

706 search results - page 13 / 142
» On a quasi-ordering on Boolean functions
Sort
View
IWANN
2005
Springer
14 years 1 months ago
Role of Function Complexity and Network Size in the Generalization Ability of Feedforward Networks
The generalization ability of different sizes architectures with one and two hidden layers trained with backpropagation combined with early stopping have been analyzed. The depend...
Leonardo Franco, José M. Jerez, José...
ASIACRYPT
2001
Springer
13 years 11 months ago
Autocorrelation Coefficients and Correlation Immunity of Boolean Functions
Abstract. We apply autocorrelation and Walsh coefficients for the investigation of correlation immune and resilient Boolean functions. We prove new lower bound for the absolute ind...
Yuriy Tarannikov, Peter Korolev, Anton Botev
SETA
2010
Springer
137views Mathematics» more  SETA 2010»
13 years 6 months ago
On a Conjecture about Binary Strings Distribution
It is a difficult challenge to find Boolean functions used in stream ciphers achieving all of the necessary criteria and the research of such functions has taken a significant d...
Jean-Pierre Flori, Hugues Randriam, Gérard ...
DATE
2003
IEEE
85views Hardware» more  DATE 2003»
14 years 28 days ago
Set Manipulation with Boolean Functional Vectors for Symbolic Reachability Analysis
Symbolic techniques usually use characteristic functions for representing sets of states. Boolean functional vectors provide an alternate set representation which is suitable for ...
Amit Goel, Randal E. Bryant
MST
2006
120views more  MST 2006»
13 years 7 months ago
Exploiting Regularities for Boolean Function Synthesis
The "regularity" of a Boolean function can be exploited for decreasing its minimization time. It has already been shown that the notion of autosymmetry is a valid measure...
Anna Bernasconi, Valentina Ciriani, Fabrizio Lucci...