Sciweavers

1099 search results - page 20 / 220
» String Transformation Learning
Sort
View
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
13 years 8 months ago
Experiments with indexed FOR-loops in genetic programming
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
Gayan Wijesinghe, Victor Ciesielski
CRYPTO
2006
Springer
89views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
Oblivious Transfer and Linear Functions
Abstract. We study unconditionally secure 1-out-of-2 Oblivious Transfer (1-2 OT). We first point out that a standard security requirement for 1-2 OT of bits, namely that the receiv...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...
EC
1998
178views ECommerce» more  EC 1998»
13 years 7 months ago
The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory
This paper is the first part of a two part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary repres...
Michael D. Vose, Alden H. Wright
DRM
2007
Springer
14 years 1 months ago
Randomized radon transforms for biometric authentication via fingerprint hashing
We present a new technique for generating biometric fingerprint hashes, or summaries of information contained in human fingerprints. Our method calculates and aggregates various...
Mariusz H. Jakubowski, Ramarathnam Venkatesan
ASIACRYPT
2010
Springer
13 years 5 months ago
Limitations on Transformations from Composite-Order to Prime-Order Groups: The Case of Round-Optimal Blind Signatures
sion of an extended abstract published in Proceedings of Asiacrypt 2010, Springer-Verlag, 2010. Available from the IACR Cryptology ePrint Archive as Report 2010/474. Beginning wit...
Sarah Meiklejohn, Hovav Shacham, David Mandell Fre...