-
## Tree-based approach
- [Optimised kd-trees for fast image descriptor matching](https://users.cecs.anu.edu.au/~hartley/Papers/PDF/SilpaAnan:CVPR08.pdf)
- [Data structures and algorithms for neare…
-
All documentation must be adapted to the new API, including example use-cases.
VarIr updated
4 months ago
-
This type of neural network may work well with your DSP chips:
https://github.com/S6Regen/Fixed-Filter-Bank-Neural-Networks
ghost updated
5 years ago
-
Common 1-N implementations such as presented in #4 use KD-trees such as [`sklearn`'s KMeans](https://github.com/scikit-learn/scikit-learn/blob/82df48934eba1df9a1ed3be98aaace8eada59e6e/sklearn/cluster/…
-
Write a command to convert old usage to subrepo
-
- [ ] [nmslib/README.md at master · nmslib/nmslib](https://github.com/nmslib/nmslib)
# Non-Metric Space Library (NMSLIB)
## Important Notes
* NMSLIB is generic but fast, see the results of [A…
-
#### Introduction
Vector databases have gained significant importance due to the rise of AI, machine learning, and deep learning applications. These databases store high-dimensional vectors repre…
-
Currently there is no implementation of Fast Walsh–Hadamard transform in SciPy. Although it seems that FWHT is not as general as FFT but it is pretty ubiquitous ,it is there is other maths and science…
-
If you apply a predetermined random pattern of sign flipping to an input array followed by the fast (Walsh) Hadamard transform you get a random projection of the input data. You can use that for unbi…
ghost updated
4 years ago
-
## Description of bug / unexpected behavior
In 2D, put_start_and_end_on can be used to animate the tip of an arrow. In 3D the size/volume of the arrow appears to increase without bound, and also …