Sciweavers

140 search results - page 7 / 28
» String Quartets In Binary
Sort
View
ICB
2007
Springer
104views Biometrics» more  ICB 2007»
14 years 1 months ago
Selection of Distinguish Points for Class Distribution Preserving Transform for Biometric Template Protection
This paper addresses the biometric template security issue. Follow out previous work on class distribution transform, the proposed scheme selects the distinguish points automatical...
Yi C. Feng, Pong C. Yuen
GECCO
2006
Springer
282views Optimization» more  GECCO 2006»
13 years 11 months ago
A genetic algorithm for the longest common subsequence problem
A genetic algorithm for the longest common subsequence problem encodes candidate sequences as binary strings that indicate subsequences of the shortest or first string. Its fitnes...
Brenda Hinkemeyer, Bryant A. Julstrom
ESA
2005
Springer
155views Algorithms» more  ESA 2005»
14 years 1 months ago
A Loopless Gray Code for Minimal Signed-Binary Representations
A string . . . a2a1a0 over the alphabet {−1, 0, 1} is said to be a minimal signed-binary representation of an integer n if n =   k≥0 ak2k and the number of non-zero digits is ...
Gurmeet Singh Manku, Joe Sawada
LATIN
2004
Springer
14 years 27 days ago
Combinatorial Problems on Strings with Applications to Protein Folding
We consider the problem of protein folding in the HP model on the 3D square lattice. This problem is combinatorially equivalent to folding a string of 0’s and 1’s so that the s...
Alantha Newman, Matthias Ruhl
STACS
2007
Springer
14 years 1 months ago
On the Complexity of Unary Tiling-Recognizable Picture Languages
Abstract. We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary...
Alberto Bertoni, Massimiliano Goldwurm, Violetta L...