| hora-search/hora |
2,469 |
|
0 |
0 |
over 2 years ago |
2 |
August 07, 2021 |
23 |
apache-2.0 |
Rust |
| 🚀 efficient approximate nearest neighbor search algorithm collections library written in Rust 🦀 . |
| lemire/FastPFor |
816 |
|
0 |
0 |
over 2 years ago |
0 |
|
14 |
apache-2.0 |
C++ |
| The FastPFOR C++ library: Fast integer compression |
| tlk00/BitMagic |
395 |
|
0 |
0 |
about 2 years ago |
0 |
|
6 |
other |
C++ |
| BitMagic Library |
| lemire/SIMDCompressionAndIntersection |
374 |
|
0 |
0 |
almost 3 years ago |
0 |
|
4 |
apache-2.0 |
C++ |
| A C++ library to compress and intersect sorted lists of integers using SIMD instructions |
| DragonSpit/HPCsharp |
204 |
|
1 |
1 |
over 2 years ago |
70 |
April 09, 2023 |
2 |
apache-2.0 |
C# |
| High performance algorithms in C#: SIMD/SSE, multi-core and faster |
| llogiq/bytecount |
193 |
|
396 |
97 |
over 2 years ago |
21 |
October 24, 2023 |
7 |
apache-2.0 |
Rust |
| Counting occurrences of a given byte or UTF-8 characters in a slice of memory – fast |
| raygon-renderer/thermite |
149 |
|
0 |
0 |
over 4 years ago |
0 |
|
2 |
other |
Rust |
| Thermite SIMD: Melt your CPU |
| Daniel-Liu-c0deb0t/block-aligner |
111 |
|
0 |
0 |
over 2 years ago |
10 |
August 05, 2023 |
7 |
mit |
Jupyter Notebook |
| SIMD-accelerated library for computing global and X-drop affine gap penalty sequence-to-sequence or sequence-to-profile alignments using an adaptive block-based algorithm. |
| dthuerck/mapmap_cpu |
93 |
|
0 |
0 |
almost 3 years ago |
0 |
|
7 |
bsd-3-clause |
C++ |
| A high-performance general-purpose MRF MAP solver, heavily exploiting SIMD instructions. |
| Daniel-Liu-c0deb0t/triple_accel |
73 |
|
0 |
5 |
over 3 years ago |
10 |
June 18, 2021 |
4 |
mit |
Rust |
| Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search. |
