Vantage Point Tree (VPTree) for fast k-NN and radius searches in metric spaces.
A vantage-point tree implementation backed by vectors for good performance with no unsafe code.
Zero-config nonparametric supervised learning — KNN with auto-tuned K, metric learning, and VP-tree indexing
A combined Vantage-Point AVL tree, to make VP trees updateable.
Face/object recognition with cosine matching and VP-Tree ANN
Temporal Attractor Studio - Real FTLE calculation and temporal dynamics prediction with VP-tree optimization
Vantage Point Tree search algorithm for fast nearest neighbour search in multi-dimensional metric spaces.
Rust computer vision and deep learning framework
Multi-object tracking with DeepSORT, ByteTrack, and Kalman filter
As Close As Possible — nearest neighbor search in Rust.
A simple debounce and throttling tool suitable for FLTK applications. Can be used to control the frequency of UI event processing or the frequency of function calls for other non UI events. Non macro processing, pure code control. Relying on tokio implementation.
Simple parsing of the merged Penn Treebank format.