A Rust implementation of the K2Tree, an extremely space-efficient way of representing sparse bit-matrices.
-
Updated
Apr 13, 2022 - Rust
A Rust implementation of the K2Tree, an extremely space-efficient way of representing sparse bit-matrices.
This project focuses on lossless compression techniques optimizing space, time, and energy for multiplications between binary (or ternary) matrix formats and real-valued vectors.
Add a description, image, and links to the k2-tree topic page so that developers can more easily learn about it.
To associate your repository with the k2-tree topic, visit your repo's landing page and select "manage topics."