Sciweavers

247 search results - page 41 / 50
» On Pseudorandom Generators in NC
Sort
View
CSR
2011
Springer
12 years 11 months ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov
HPCA
2006
IEEE
14 years 7 months ago
Probabilistic counter updates for predictor hysteresis and stratification
Hardware counters are a fundamental building block of modern high-performance processors. This paper explores two applications of probabilistic counter updates, in which the outpu...
Nicholas Riley, Craig B. Zilles
CEC
2008
IEEE
14 years 1 months ago
Improved Particle Swarm Optimization with low-discrepancy sequences
— Quasirandom or low discrepancy sequences, such as the Van der Corput, Sobol, Faure, Halton (named after their inventors) etc. are less random than a pseudorandom number sequenc...
Millie Pant, Radha Thangaraj, Crina Grosan, Ajith ...
FOCS
2008
IEEE
14 years 1 months ago
Leakage-Resilient Cryptography
We construct a stream-cipher SC whose implementation is secure even if a bounded amount of arbitrary (adaptively, adversarially chosen) information about the internal state of SC ...
Stefan Dziembowski, Krzysztof Pietrzak
ICASSP
2008
IEEE
14 years 1 months ago
Robust video fingerprints based on subspace embedding
We present a novel video fingerprinting method based on subspace embedding. The proposed method is particularly robust against frame-rate conversion attacks and geometric attacks...
Regunathan Radhakrishnan, Claus Bauer