406 search results - page 27 / 82 » Pseudorandomness and Combinatorial Constructions |
TCC
2010
Springer
14 years 8 months ago
2010
Springer
We construct public-key cryptosystems that remain secure even when the adversary is given any computationally uninvertible function of the secret key as auxiliary input (even one t...
ESANN
2006
14 years 16 days ago
2006
Abstract. Ensemble methods allow to improve the accuracy of classification methods. This work considers the application of one of these methods, named Rotation-based, when the clas...
BSL
2010
13 years 8 months ago
2010
Abstract. We present a survey of some results and problems concerning constructions which require a diagonalization of length continuum to be carried out, particularly construction...
GECCO
2005
Springer
14 years 4 months ago
2005
Springer
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
AAAI
2010
14 years 18 days ago
2010
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...