67 search results - page 9 / 14 » Common Substrings in Random Strings |
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
The evolution of music, from random note strings to certain “pleasant” note sequences, is traced in a multi-agent computational model. A community of agents, with some musical ...
TCC
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
90
Voted
KDD
2001
ACM
16 years 18 hour ago
2001
ACM
We introduce and evaluate TreeDT, a novel gene mapping method which is based on discovering and assessing tree-like patterns in genetic marker data. Gene mapping aims at discoveri...
PLDI
2012
ACM
13 years 2 months ago
2012
ACM
To report a compiler bug, one must often find a small test case that triggers the bug. The existing approach to automated test-case reduction, delta debugging, works by removing ...
107
click to vote
EUROCRYPT
2010
Springer
15 years 2 months ago
2010
Springer
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...