Sciweavers

10 search results - page 2 / 2
» Post-Processing Functions for a Biased Physical Random Numbe...
Sort
View
ISPA
2004
Springer
13 years 10 months ago
A Scalable Low Discrepancy Point Generator for Parallel Computing
The Monte Carlo (MC) method is a simple but effective way to perform simulations involving complicated or multivariate functions. The QuasiMonte Carlo (QMC) method is similar but...
Kwong-Ip Liu, Fred J. Hickernell
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
13 years 9 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
PG
2007
IEEE
13 years 11 months ago
Statistical Hypothesis Testing for Assessing Monte Carlo Estimators: Applications to Image Synthesis
Image synthesis algorithms are commonly compared on the basis of running times and/or perceived quality of the generated images. In the case of Monte Carlo techniques, assessment ...
Kartic Subr, James Arvo
COCO
2006
Springer
93views Algorithms» more  COCO 2006»
13 years 9 months ago
Making Hard Problems Harder
We consider a general approach to the hoary problem of (im)proving circuit lower bounds. We define notions of hardness condensing and hardness extraction, in analogy to the corres...
Joshua Buresh-Oppenheim, Rahul Santhanam
ICS
2010
Tsinghua U.
14 years 2 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz