-
Currently, we have two ways to control neighbor selection with the KdTreeCrossmatch algorithm: the maximum number of neighbors to select `n_neighbors` and the maximum radius `radius_arcsec`. However, …
-
not really an issue, but a question/comment as id love to contribute to phistoffury... have you looked into piggybacking off spotify's annoy framework in lieu of kd trees?
https://github.com/spotif…
-
Drawpile version 2.2.1, Linux
### Problem
When looking at a large canvas while zoomed out (for example, 4000x4000 on a 1080p screen), the canvas view looks extremely aliased, as if using nearest n…
-
It looks like behavior might have changed from stable to the alpha regarding large images being downsampled. The case below is a bit of an extreme one, but a 3200x3200 image resized to 200x200 previou…
mnutt updated
3 years ago
-
As per the title, with screen resolutions beyond 1080p "Big HUD" is no longer sufficient at emulating the HUD scale of 640x480 (which IIRC is the reference for Big HUD originally). If possible, it may…
-
Hi,
Is it possible to specifying the Heisenberg exchange interactions to the **Nearest, Neighbor-Nearest, and Next-Neighbor-Nearest** lattices? Just like the following Hamiltonian described
$$
…
-
General discussion about GPU based nearest neighbor matching:
- [ ] CUDA/OpenCL/Genericity vs. Dedicated implementation...
-
http://stackoverflow.com/questions/5696859/how-do-i-use-kd-trees-for-determining-string-similarity
-
Good job!
But could you please tell me where the code for the nearest neighbor matching methods (such as PQ/IVF/PQIVF/HNSW, etc.) is located?
-
I want to return the nearest neighbor to my data point. However, it is returning the wrong one. I tried returning multiple nearest neighbors and there also seem to be some inconsistencies with the ret…