Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles.
Stephen BaumertArchis GhateSeksan KiatsupaibulYanfang ShenRobert L. SmithZelda B. ZabinskyPublished in: Oper. Res. (2009)
Keyphrases
- sampled data
- discrete geometry
- simply connected
- highly skewed
- random sampling
- efficient algorithms to compute
- irregularly spaced
- computational geometry
- decision variables
- random samples
- sample points
- continuous functions
- endpoints
- gaussian distribution
- point sets
- data sets
- sampling methods
- sampling strategy
- keypoints
- sample size
- feature points
- probability distribution
- learning algorithm