Sciweavers

67 search results - page 9 / 14
» Common Substrings in Random Strings
Sort
View
CEC
2005
IEEE
14 years 2 months ago
Music evolution in a complex system of interacting agents
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 ...
Tao Gong, Qian Zhang, Hua Wu
TCC
2007
Springer
91views Cryptology» more  TCC 2007»
14 years 2 months ago
Lower Bounds for Non-interactive Zero-Knowledge
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...
Hoeteck Wee
KDD
2001
ACM
142views Data Mining» more  KDD 2001»
14 years 9 months ago
TreeDT: gene mapping by tree disequilibrium test
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...
Petteri Sevon, Hannu Toivonen, Vesa Ollikainen
PLDI
2012
ACM
11 years 11 months ago
Test-case reduction for C compiler bugs
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 ...
John Regehr, Yang Chen, Pascal Cuoq, Eric Eide, Ch...
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