Journal ArticleDOI
An Efficient Method for Generating Discrete Random Variables with General Distributions
Reads0
Chats0
TLDR
The fast generation of discrete random variables with arbitrary frequency distributions is discussed, related to rejection techniques but differs from them in that all samples comprising the input data contribute to the samples in the target distribution.Abstract:
The fast generation of discrete random variables with arbitrary frequency distributions is discussed. The proposed method is related to rejection techniques but differs from them in that all samples comprising the input data contribute to the samples in the target distribution. The software implementation of the method requires at most two memory references and a comparison. The method features good accuracy and modest storage requirements. I t is particularly useful in small computers with limited memory capacity.read more
Citations
More filters
Proceedings ArticleDOI
Sampling from the exponential distribution using independent Bernoulli variates
David B. Thomas,Wayne Luk +1 more
TL;DR: This paper shows that each bit of a fixed-point exponential random variate is an independent Bernoulli variate, allowing the bits to be generated in parallel, and is particularly useful for very high performance applications.
Proceedings ArticleDOI
Learning Recommenders for Implicit Feedback with Importance Resampling
TL;DR: This paper proposes an Adaptive Sampling method based on Importance Resampling (AdaSIR for short), which is not only almost equally efficient and accurate for any recommender models, but also can robustly accommodate arbitrary proposal distributions.
Journal ArticleDOI
Theory and implementation of a novel stochastic approach to coupled cluster
TL;DR: The diagCCMC algorithm as mentioned in this paper performs an imaginary-time propagation of the similarity-transformed coupled cluster Schrodinger equation, where each term is evaluated as a randomly realized diagram in the connected expansion of the Hamiltonian.
DissertationDOI
Non-Periodic Corner Tilings in Computer Graphics
TL;DR: This dissertation investigates the use of corner tiles with color-coded corners, and presents efficient algorithms to perform such a tiling that are both more flexible and less prone to artifacts than existing algorithms.
References
More filters
Journal ArticleDOI
An approximate method for generating asymmetric random variables
TL;DR: A method for generating values of continuous symmetric random variables that is relatively fast, requires essentially no computer memory, and is easy to use is developed.
Journal ArticleDOI
New fast method for generating discrete random numbers with arbitrary frequency distributions
TL;DR: A new method for generating discrete random numbers with arbitrary amplitude/frequency distributions is presented, which consists essentially of amplitude manipulation of uniformly distributed, statistically independent sequential numbers.
Journal ArticleDOI
Fast generation of uniformly distributed pseudorandom numbers with floating-point representation
TL;DR: A new method is presented for generating uniformly distributed pesudorandom numbers with a floating-point representation that features fast single-clock-pulse operation.
Journal ArticleDOI
Pseudonoise with Arbitrary Amplitude Distribution--Part I: Theory
John S. Sobolewski,W. H. Payne +1 more
TL;DR: A new sampling method, conditional bit sampling, which is suited for hardwired sampling devices because of its generality, simplicity, and accuracy, and agreement between actual and theoretical performance was excellent.