Generalized Golden Spiral methods for quasi-random low-discrepancy points generation.
-
Updated
Mar 10, 2022 - Python
Generalized Golden Spiral methods for quasi-random low-discrepancy points generation.
Code and data for an empirical square-root law of the degree discrepancy of binary m-sequences. Joonas Pääkkönen. Dr. Sci. Senior lecturer, Department of Information and Data Management, Dalarna University, Borlänge, Sweden.
SAT campaign against N(k,2) - Erdos problem #176 and OEIS A398541 - with a cold verification gate that must pass before this repo asserts anything.
Domain Adaptation with Dynamic Open-Set Targets
To associate your repository with the discrepancy topic, visit your repo's landing page and select "manage topics."