-
In the rASR matlab implementation, the geometric median is euclidean.
For now, python RASR uses also the euclidean geometric median (with the different optimization method though).
We might want …
-
# Properties of GCD (Greatest Common Divisor)
- **Blueprint of Numbers:** The GCD of a set of numbers can be thought of as a blueprint of those numbers. If you keep adding the GCD, you can make all…
-
The following implementations use a generic `impl Distance` parameter, but only provide a `Default` impl for the `Euclidean` distance.
- KNNClassifier
- KNNRegressor
- DBSCAN
- KMeans
In one …
-
I would like a knob that controls how the hits are distributed across the sequence, from totally Euclidean to totally random and everywhere in between.
I'd suggest that the hits change when the kno…
-
The Prelude erred, I believe, in offering machine division (`quotRem`) and Knuthian division (`divMod`) as the standard division operations. I think we want to keep Knuthian division around for the si…
-
Hello, I've recently been browsing pi-base, and could not find a good example of a space that would be pseudocompact, not compact, $T_1$, and exhaustible by compact sets.
The space I am addressing …
-
Dear authors,
My question is the following: since the low-dimensional embeddings are optimized so that their weighted graph representation is as close as possible to the "high dimensional graph" (t…
-
If adata.n_obs < 4096 and umap version >= 0.4 and if `metric` is a distance that is not supported by scikit-learn (like ll_dirichlet or hellinger), we get a ValueError:
Code for reproducing with UM…
-
**Is your feature request related to a problem? Please describe.**
Various TRPGs have different ways they handle distance measurements, especially along diagonals. For example, D&D 5e allows non-eucl…
-
Once the ROM is defined in terms of the weak formulations (mass, stiffness, forcings, etc.), boundary conditions, parameter space, and hyper reductions, it would be good to automate the "reporting".
…
KikeM updated
2 years ago