Component-by-component construction of low-discrepancy point sets of small size
From MaRDI portal
Publication:3516786
Recommendations
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
- The inverse of the star-discrepancy problem and the generation of pseudo-random numbers
- Low-discrepancy point sets
- Bounds and constructions for the star-discrepancy via \(\delta\)-covers
- Low-discrepancy point sets obtained by digital constructions over finite fields
Cites work
- A note on the existence of sequences with small star discrepancy
- An algorithm to compute bounds for the star discrepancy
- Application of Threshold-Accepting to the Evaluation of the Discrepancy of a Set of Points
- Bounds and constructions for the star-discrepancy via \(\delta\)-covers
- Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy
- Covering numbers, Vapnik-Červonenkis classes and bounds for the star-discrepancy
- Dependent rounding and its applications to approximation algorithms
- Funktionen von beschränkter Variation in der Theorie der Gleichverteilung
- Generating Randomized Roundings with Cardinality Constraints and Derandomizations
- Improved upper bounds on the star discrepancy of \((t,m,s)\)-nets and \((t,s)\)-sequences
- Point sets and sequences with small discrepancy
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- Probability Inequalities for Sums of Bounded Random Variables
- Randomly Rounding Rationals with Cardinality Constraints and Derandomizations
- Some open problems concerning the star-discrepancy
- The inverse of the star-discrepancy depends linearly on the dimension
Cited in
(20)- Probabilistic star discrepancy bounds for double infinite random matrices
- On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence
- Algorithmic construction of low-discrepancy point sets via dependent randomized rounding
- Discrepancy bounds for a class of negatively dependent random points including Latin hypercube samples
- Component-by-Component Construction of Hybrid Point Sets Based on Hammersley and Lattice Point Sets
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems
- Construction of low-discrepancy point sets of small size by bracketing covers and dependent randomized rounding
- Implementation of a component-by-component algorithm to generate small low-discrepancy samples
- Point-sensitive and point-free patch constructions
- Probabilistic discrepancy bound for Monte Carlo point sets
- A note on the existence of sequences with small star discrepancy
- Calculation of discrepancy measures and applications
- Theory of generalized discrepancies on a ball of arbitrary finite dimensions and algorithms for finding low-discrepancy point sets
- Discrepancy theory and quasi-Monte Carlo integration
- A generalized Faulhaber inequality, improved bracketing covers, and applications to discrepancy
- The inverse of the star-discrepancy problem and the generation of pseudo-random numbers
- Entropy, Randomization, Derandomization, and Discrepancy
- Some results on the complexity of numerical integration
- Heuristic approaches to obtain low-discrepancy point sets via subset selection
- Calculation of the discrepancy of a finite set of points in the unit n -cube
This page was built for publication: Component-by-component construction of low-discrepancy point sets of small size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3516786)
