406 search results - page 17 / 82 » Pseudorandomness and Combinatorial Constructions |
APPROX
2009
Springer
15 years 5 months ago
2009
Springer
The area of derandomization attempts to provide efficient deterministic simulations of randomized algorithms in various algorithmic settings. Goldreich and Wigderson introduced a n...
EJC
2008
14 years 11 months ago
2008
We consider certain modules of the symmetric groups whose basis elements are called tabloids. As modules of the symmetric groups, some of these are isomorphic to Springer modules. ...
PAMI
1998
14 years 10 months ago
1998
—Much of previous attention on decision trees focuses on the splitting criteria and optimization of tree sizes. The dilemma between overfitting and achieving maximum accuracy is ...
110
click to vote
CRYPTO
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. The paradigms currently used to realize symmetric encryption schemes secure against adaptive chosen ciphertext attack (CCA) try to make it infeasible for an attacker to f...
ISCAS
2008
IEEE
15 years 5 months ago
2008
IEEE
— The lack of robust tamper-proofing techniques in security applications has provided attackers the ability to virtually circumvent mathematically strong cryptographic primitive...