byronknoll / lstm-compressLinks
Data compression using LSTM
☆134Updated 2 years ago
Alternatives and similar repositories for lstm-compress
Users that are interested in lstm-compress are comparing it to the libraries listed below
Sorting:
- Data compression using LSTM in TensorFlow☆104Updated 2 years ago
- ☆213Updated 5 years ago
- rANS coder (derived from https://github.com/rygorous/ryg_rans)☆83Updated 3 years ago
- MCM file compressor☆113Updated 7 years ago
- Clover: Quantized 4-bit Linear Algebra Library☆114Updated 7 years ago
- Testing various methods for choosing tANS entropy coding automata☆76Updated last year
- TurboRC - Fastest Range Coder + Arithmetic Coding / Fastest Asymmetric Numeral Systems☆83Updated last year
- XWRT (XML-WRT) is an efficient XML/HTML/text compressor☆41Updated 8 years ago
- msufsort parallel suffix array construction algorithm☆29Updated 4 years ago
- Wolfsort is a stable adaptive hybrid radix / merge sort.☆196Updated 11 months ago
- novel high throughput entropy encoder for BWT data☆15Updated 2 years ago
- High performance block-sorting data compression library☆322Updated last month
- adaptive arithmetic coder☆50Updated 7 years ago
- Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"☆204Updated 5 years ago
- PPM compressor with high compression ratio.☆32Updated 7 years ago
- Simple rANS encoder/decoder (arithmetic coding-ish entropy coder).☆328Updated 2 years ago
- This package contains source code for special JPEG decompression and recompression routines, which may help developers as a framework in…☆16Updated 9 years ago
- libcubwt is a library for GPU accelerated suffix array and burrows wheeler transform construction.☆36Updated 2 months ago
- Fast and Strong Burrows Wheeler Model☆19Updated 6 years ago
- Experimental parallel compression algorithm☆25Updated 7 years ago
- Experimental compression format (unmaintained, do not use!)☆32Updated 9 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆156Updated 5 months ago
- String Matching Algorithms Research Tool☆103Updated last year
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 4 years ago
- rans optimized tricks☆24Updated 7 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆137Updated 5 months ago
- Fastest Histogram Construction☆70Updated 3 years ago
- VTEnc C library☆37Updated 2 years ago
- A minimal modern LZ compressor example☆59Updated 4 years ago
- Fast and Reliable (but not Secure) Hash☆54Updated 7 years ago