Sciweavers

6142 search results - page 519 / 1229
» The Complexity of Partition Functions
Sort
View
FSE
2006
Springer
109views Cryptology» more  FSE 2006»
15 years 10 months ago
Computing the Algebraic Immunity Efficiently
The purpose of algebraic attacks on stream and block ciphers is to recover the secret key by solving an overdefined system of multivariate algebraic equations. They become very eff...
Frédéric Didier, Jean-Pierre Tillich
ISSS
1995
IEEE
98views Hardware» more  ISSS 1995»
15 years 10 months ago
On the use of VHDL-based behavioral synthesis for telecom ASIC design
higher levels of abstraction, due to the still increasing design complexities that can be expected in the near future. Behavioral synthesis can play a key role in this prospect, as...
Mark Genoe, Paul Vanoostende, Geert van Wauwe
ICML
1994
IEEE
15 years 10 months ago
Hierarchical Self-Organization in Genetic programming
This paper presents an approach to automatic discovery of functions in Genetic Programming. The approach is based on discovery of useful building blocks by analyzing the evolution...
Justinian P. Rosca, Dana H. Ballard
SIGGRAPH
1991
ACM
15 years 10 months ago
A global illumination solution for general reflectance distributions
A general light transfer simulation algorithm for environments composed of materials with arbitrary reflectance functions is presented. This algorithm removes the previous practic...
François X. Sillion, James Arvo, Stephen H....
DAC
1989
ACM
15 years 10 months ago
An Efficient Finite Element Method for Submicron IC Capacitance Extraction
We present an accurate and efficient method for extraction of parasitic capacitances in submicron integrated circuits. The method uses a 3-D finite element model in which the cond...
N. P. van der Meijs, Arjan J. van Genderen