1696 search results - page 40 / 340 » Permuted function matching |
114
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
107
click to vote
CRYPTO
2001
Springer
15 years 7 months ago
2001
Springer
Recently Victor Shoup noted that there is a gap in the widely-believed security result of OAEP against adaptive chosen-ciphertext attacks. Moreover, he showed that, presumably, OA...
JCT
2007
15 years 2 months ago
2007
We characterise the permutations π such that the elements in the closed lower Bruhat interval [id,π] of the symmetric group correspond to non-taking rook configurations on a sk...
108
Voted
CEC
2007
IEEE
15 years 8 months ago
2007
IEEE
—This paper describes an evolutionary music composition system that combines trainable music critics with a bag of notes constraint. Unlike many evolutionary composition systems,...
115
click to vote
IRI
2009
IEEE
15 years 9 months ago
2009
IEEE
Traditional schema matchers use a set of distinct simple matchers and use a composition function to combine the individual scores using an arbitrary order of matcher application l...