Sciweavers

516 search results - page 54 / 104
» Sets of k-Independent Strings
Sort
View
SCCC
2002
IEEE
15 years 4 months ago
Improved Antidictionary Based Compression
The compression of binary texts using antidictionaries is a novel technique based on the fact that some substrings (called “antifactors”) never appear in the text. Let × be a...
Maxime Crochemore, Gonzalo Navarro
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 3 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom
90
Voted
CRYPTO
2001
Springer
153views Cryptology» more  CRYPTO 2001»
15 years 3 months ago
Universally Composable Commitments
d Abstract) Ran Canetti and Marc Fischlin Abstract. We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantee...
Ran Canetti, Marc Fischlin
GECCO
2006
Springer
116views Optimization» more  GECCO 2006»
15 years 2 months ago
A crossover for complex building blocks overlapping
We propose a crossover method to combine complexly overlapping building blocks (BBs). Although there have been several techniques to identify linkage sets of loci o form a BB [4, ...
Miwako Tsuji, Masaharu Munetomo, Kiyoshi Akama
CRYPTO
2010
Springer
228views Cryptology» more  CRYPTO 2010»
15 years 7 days ago
On Generalized Feistel Networks
We prove beyond-birthday-bound security for most of the well-known types of generalized Feistel networks: (1) unbalanced Feistel networks, where the n-bit to m-bit round functions ...
Viet Tung Hoang, Phillip Rogaway