Sciweavers

516 search results - page 82 / 104
» Sets of k-Independent Strings
Sort
View
GECCO
2010
Springer
188views Optimization» more  GECCO 2010»
14 years 2 days ago
Benchmarking real-coded genetic algorithm on noisy black-box optimization testbed
Originally, genetic algorithms were developed based on the binary representation of candidate solutions in which each conjectured solution is a fixed-length string of binary numb...
Thanh-Do Tran, Gang-Gyoo Jin
EUROCRYPT
2010
Springer
13 years 12 months ago
Constructing Verifiable Random Functions with Large Input Spaces
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
Susan Hohenberger, Brent Waters
BIBM
2008
IEEE
125views Bioinformatics» more  BIBM 2008»
13 years 10 months ago
On the Role of Local Matching for Efficient Semi-supervised Protein Sequence Classification
Recent studies in protein sequence analysis have leveraged the power of unlabeled data. For example, the profile and mismatch neighborhood kernels have shown significant improveme...
Pavel P. Kuksa, Pai-Hsi Huang, Vladimir Pavlovic
CDC
2008
IEEE
120views Control Systems» more  CDC 2008»
13 years 10 months ago
Left invertibility of discrete systems with finite inputs and quantized output
Abstract-- The aim of this paper is to address left invertibility for dynamical systems with inputs and outputs in discrete sets. We study systems that evolve in discrete time with...
Nevio Dubbini, Benedetto Piccoli, Antonio Bicchi
CCS
2008
ACM
13 years 10 months ago
Efficient and extensible security enforcement using dynamic data flow analysis
Current taint tracking systems suffer from high overhead and a lack of generality. In this paper, we solve both of these issues with an extensible system that is an order of magni...
Walter Chang, Brandon Streiff, Calvin Lin