-
Hello @QingyongHu, Thanks for the great work, I've been working on it since a few days.
I was testing the model on my data which has around 3-5 million points.
I've finished testing, although when I…
-
Is there a process/parameter setting that will make sure queries return no less than `k` ANN? (and preferably also not much more than `k`... exactly `k` would be ideal)
Like when the user asks for _e…
-
2.0.0 will have an entirely new graphics suite. Some mods might get carried over, but the intent is to make LS truly stunning to look at. This likely means it will eat computers for breakfast and stil…
-
Add example code that uses the generic framework based on ImgLib2 using kd-trees for applying filters (e.g. Mean, Median, Gaussian) to irregularly-spaced data.
-
Hi,
got a new issue when trying to make a uvi image of a galaxy using a gadgethdf5 snap.
> ValueError: pos and mass arrays must have matching dtypes for kdtree
I checked the dtypes and found…
-
Inspiration is taken from how git packs achieve high compression rates with good random access performance. The 2 key components are (1) a clustering strategy to store similar objects together and (2)…
-
As stated in the documentation, `scipy.signal.find_peaks` works for 1D signals.
There are many attempts of similar function for 2D arrays, such as https://stackoverflow.com/questions/3684484/peak-d…
-
## Quick summary
NFS The Run has some weird behaviour and rendering issues, due to using a Frostbite 2 Engine.
## Details
**Describe issue:**
- If I enable "SPU Loop Detection" and "Lower SPU th…
-
Nearest neighbour algorithms are an item in the roadmap. They're helpful in clustering algorithms, particularly DBSCAN. There are a number of existing implementations of advanced nearest neighbour alg…
-
I have tried this algorithm and flann on low dimensional dataset(3-d point cloud).
Here are 800000+ map points, and 300 query points, and find the query points' k neighbor with this algorithm and fla…
suimo updated
4 years ago