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
Book ChapterDOI
Facial Landmark Localization Using Robust Relationship Priors and Approximative Gibbs Sampling
TL;DR: The facial landmark localization problem as an inference problem over a Markov Random Field is tackled using Gibbs sampling with approximated full conditional distributions in a latent variable model and the exceptional robustness of the method is realized by utilizing a \(L_{1}\)-loss function and via the new robust shape model based on pairwise topological constraints.
Posted ContentDOI
Boundary Value Caching for Walk on Spheres
TL;DR: In this article , the authors propose a fast caching strategy which first estimates solution values and derivatives at randomly sampled points along the boundary of the domain (or a local region of interest), then provides cheap, output-sensitive evaluation of the solution (or its gradient) at interior points, via a boundary integral formulation.
Posted Content
Inexact Variable Metric Stochastic Block-Coordinate Descent for Regularized Optimization
Ching-pei Lee,Stephen J. Wright +1 more
TL;DR: In this article, an inexact randomized BCD method based on a regularized quadratic subproblem was proposed, in which the quadratically term can vary from iteration to iteration: a variable metric.
Proceedings ArticleDOI
TDV-based Filter for Novelty and Diversity in a Real-time Pub/Sub System
TL;DR: This paper proposes in this paper a scalable approach for filtering news (items) which match the user interests (expressed as subscriptions) and introduces for the first time Term Discrimination Value (TDV) in this context.
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.