Sciweavers

140 search results - page 24 / 28
» String Quartets In Binary
Sort
View
BIOADIT
2004
Springer
14 years 29 days ago
Searching for a Practical Evidence of the No Free Lunch Theorems
Abstract. According to the No Free Lunch (NFL) theorems all blackbox algorithms perform equally well when compared over the entire set of optimization problems. An important proble...
Mihai Oltean
ICBA
2004
Springer
143views Biometrics» more  ICBA 2004»
14 years 28 days ago
Externalized Fingerprint Matching
The 9/11 tragedy triggered an increased interest in biometric passports. According to several sources [2], the electronic ID market is expected to increase by more than 50% per ann...
Claude Barral, Jean-Sébastien Coron, David ...
ACNS
2010
Springer
189views Cryptology» more  ACNS 2010»
14 years 11 days ago
High Performance GHASH Function for Long Messages
Abstract. This work presents a new method to compute the GHASH function involved in the Galois/Counter Mode of operation for block ciphers. If X = X1 . . . Xn is a bit string made ...
Nicolas Meloni, Christophe Nègre, M. Anwar ...
GECCO
2000
Springer
200views Optimization» more  GECCO 2000»
13 years 11 months ago
Chemical Crossover
During chemical reactions, molecules interact to produce new molecules. Some of the reaction mechanisms are very close to the way gene combine to produce new genes. Like the class...
Hugues Bersini
CIKM
2008
Springer
13 years 9 months ago
A new method for indexing genomes using on-disk suffix trees
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...