Domain Adaptation with Dynamic Open-Set Targets
-
Updated
Sep 5, 2022 - Python
Domain Adaptation with Dynamic Open-Set Targets
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 search for N(k,2) (Erdos problem #176, OEIS A398541). Results are re-checked from scratch before anything is claimed.
To associate your repository with the discrepancy topic, visit your repo's landing page and select "manage topics."