Sciweavers

429 search results - page 1 / 86
» General Pseudo-random Generators from Weaker Models of Compu...
Sort
View
FOCS
1999
IEEE
13 years 8 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
CORR
2011
Springer
169views Education» more  CORR 2011»
12 years 8 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko
EGH
2010
Springer
13 years 2 months ago
GPU random numbers via the tiny encryption algorithm
Random numbers are extensively used on the GPU. As more computation is ported to the GPU, it can no longer be treated as rendering hardware alone. Random number generators (RNG) a...
Fahad Zafar, Marc Olano, Aaron Curtis
CVPR
2000
IEEE
14 years 6 months ago
A General Method for Errors-in-Variables Problems in Computer Vision
The Errors-in-Variables (EIV) model from statistics is often employed in computer vision thoughonlyrarely under this name. In an EIV model all the measurements are corrupted by no...
Bogdan Matei, Peter Meer