-
Hi all,
first of all thanks for making this available, it looks very useful!
Is there functionality to measure the distance between two splines in `splinebox` / is there an easy way to implement…
-
As the author put it, this algorithm is much faster. For a randomly generated 3000x3000 cost matrix, it'll take a fraction of seconds to solve.
```
N_a = 3000
N_b = 3000
# Random costs
dist_mat…
-
Scipy offers [cosine similarity / distance](https://docs.scipy.org/doc/scipy/reference/generated/scipy.spatial.distance.cosine.html) on matrices. This would be useful in both dense and sparse matrice…
-
Hi, I see ur code recently, and it's an effective c++ version code about superpoint. But I can't understand the matching method in ur code. Why dot product can represent similarity between descriptors…
-
Hello!
I'm having a bit of an issue. I have V=0.2.3
I'm running this line of code:
```
gc.tl.distance.compare_conditions(
adata=adata,
library_key=library_key,
cluster_key=clust…
-
Hi,
I'm trying to run `AgglomerativeClustering` with precomputed (Euclidean) distance matrices. However, I can't get it to work with `linkage='ward'` and `metric='precomputed'` due to this `ValueEr…
-
#### Description
Precomputed distances are treated as "unsupported" by AgglomerativeClustering, regardless of the provenance. (e.g. sklearn.metrics.euclidean_distances)
This restriction makes it…
-
Hi
Thanks for creating the great package. I am currently applying MiloR to a large dataset with multiple design matrices. I've noticed that the "calcNhoodDistance" step is quite time-consuming. I w…
-
Hi! I've just implemented a generalized distance transform for matrices of arbitrary dimensions based on this paper:
["Distance Transforms of Sampled Functions"](http://www.cs.cornell.edu/~dph/papers/…
-
Problem:
Accessing health, position and other attributes that can change in between frames may show different values every X frames.
This means checking `unit.is_idle` may keep returning the same bo…