Search Results for "algorithm"

Zstandard is a fast compression algorithm, providing high compression ratios. It also offers a special mode for small data, called dictionary compression. The reference library offers a very wide range of speed / compression trade-off, and is backed by an extremely fast decoder (see benchmarks below). Zstandard library is provided as open source software using a BSD license.

LZ4 is lossless compression algorithm, providing compression speed > 500 MB/s per core (>0.15 Bytes/cycle). It features an extremely fast decoder, with speed in multiple GB/s per core (~1 Byte/cycle). A high compression derivative, called LZ4_HC, is available, trading customizable CPU time for compression ratio. LZ4 library is provided as open-source software using a BSD license.

...This happens when "one-shot" decoding API is used (or input chunk for streaming API is not limited), input size (chunk size) is larger than 2GiB, and input contains uncompressed blocks. After the overflow happens, memcpy is invoked with a gigantic num value, that will likely cause the crash. Brotli is a generic-purpose lossless compression algorithm that compresses data using a combination of a modern variant of the LZ77 algorithm, Huffman coding and 2nd order context modeling, with a compression ratio comparable to the best currently available general-purpose compression methods. It is similar in speed with deflate but offers more dense compression. The specification of the Brotli Compressed Data Format is defined in RFC 7932. ...

Simple, fast implementation of LZW (Lempel–Ziv–Welch) data compression algorithm in C. - Console encoder/decoder tools - OS independent - Could be used in embedded projects - Works with raw code-stream LZW features: - Hardcoded dictionary size - Variable code size - Code search is performed by hash table and embedded in dictionary linked lists (encoder) - No dynamic memory allocation

...So, it only works on NTFS volumes. With that, you can rename, copy or move your files (to another NTFS volume) without losing the hashes, and without needing to do anything else. The Whirlpool algorithm is a strong 512-bit hash function. This tool uses several optimized implementations with SSE4.1 or SSE2 instructions when available. Each folder is recursively processed. You can use drag-and-drop, mix files and folders, pause and resume. 64-bit: https://sourceforge.net/projects/whirlpoolfilech/files/0.5/WFileCheck64.exe 32-bit: https://sourceforge.net/projects/whirlpoolfilech/files/0.5/WFileCheck32.exe At first use, please let the integrated benchark determine the fastest procedure for your hardware. ...

A Disk Scheduling Simulator tool. With an intuitive GUI interface and command line functionality. Built using both VC and VB. Currently supports SSTF,LOOK,CLOOK,SCAN and CSCAN algorithms. Rotational latency is also optionally supported.

This software zips and unzips a .txt file, using the Huffman encoding algorithm and the list and tree data structures. The result files are named zippedFile.txt and unzippedFile.txt and can be found at the same directory as the Text Zip executable file.

Use of Michael Rabin's Information Dispersal Algorithm to provide secure, dispersed storage in a networked environment. For full download, please get both Math-FastGF2 and Crypt-IDA releases under the files link. See project wiki for more information.

The RLE compression pack is a set of utilities to compress and decompress files using RLE algorithm.

libida si library which implements Rabin's Information Dispersal Algorithm through various kernels (e.g. CUDA).

Calculates differences of executable files using a randomized algorithm for matching with mismatches.

czip is a unix based utility written for the cell broadband engine. It allows its users to compress files in gzip format. It uses Jean-loup Gailly's deflate algorithm and is based in part on pigz, Mark Adlers parallel version of zlib.

A compression engine based on the Huffman trie algorithm. The algorithm is pretty cpu-light, and as such, runs much more quickly than RAR or other 'heavy' algorithms, but could still achieve decent compression. Use with tar for multi-file archives.

Disk Optimizer selects files to be placed on any disk medium that will maximize the space used. It is very efficient in finding an optimum file set since it uses a Genetic Algorithm instead of brute force.

Iterative Compression Algorithm: trying to prove Shannon was wrong.

...Usually it implies inline assembly or trying to execute data which actually contains machine code. This is sick. Whoever is responsible for this sorry situation ought to be ashamed. So I'm going to deobfuscate LZO and provide a ISC implementation of this algorithm in Python and C. In addition, I will provide a textual description of the algorithm so that it can be easily ported to any programming language. I expect a severe performance degradation, but I leave optimizing for speed to other people.