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...
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...
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...
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...
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...