6 projects tagged "Compression"
n-ary Huffman Template Algorithm allows any kind of weights (costs, frequencies), including non-numerical ones. The {0, 1, ..., n-1} alphabet is used to encode messages. The built tree is an n-ary one. The algorithm is based on a set of template classes: Cell(SYMBOL, WEIGHT), Node(SYMBOL, WEIGHT), InternalNode (SYMBOL, WEIGHT), TerminalNode(SYMBOL, WEIGHT), BasicHuffmanTree(SYMBOL, WEIGHT, ARY), LoadedHuffmanTree(SYMBOL, WEIGHT, ARITY), and DriedHuffmanTree(WEIGHT, ARITY).
AntFlow builds upon Apache Ant to provide a new approach to simplifying system automation that uses pipelines of hot folders chained together to perform a given task. Using XML, it associates an automated task such as data transfer, encryption, or XML processing with a directory on the local system. Whenever a file is copied or written into the hot folder, the associated task is executed and the file is moved to the next hot folder in the pipeline for further processing.
PBZIP2 is a parallel implementation of the bzip2 block-sorting file compressor that uses pthreads and achieves near-linear speedup on SMP machines. The output of this version is fully compatible with bzip2 1.0.2 or newer (ie: anything compressed with PBZIP2 can be decompressed with bzip2).
MPIBZIP2 is a parallel implementation of the bzip2 block-sorting file compressor that uses MPI and achieves significant speedup on cluster machines. The output of this version is fully compatible with bzip2 1.0.2 or newer (i.e. anything compressed with MPIBZIP2 can be decompressed with bzip2).