FAQ

Calgary corpus

The Calgary corpus is a collection of text and binary data files, commonly used for comparing data compression algorithms. It was created by Ian… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1995-2016
02419952016

Related topics

Related topics

10 relations
Binary dataCanterbury corpusGzipMutual information
(More)

Broader (1)

Data compression

Related mentions per year

Related mentions per year

1950-2018
1960198020002020
Calgary corpus
Data compression
Mutual information
Binary data
VAX
SHA-1

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Context Tree Switching
This paper describes the Context Tree Switching technique, a modification of Context Tree Weighting for the prediction of binary… (More)
  • figure 1
  • table 1
Is this relevant?
2005
2005
Universal text preprocessing for data compression
Several preprocessing algorithms for text files are presented which complement each other and which are performed prior to the… (More)
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
2005
2005
Recycling Bits in LZ77-Based Compression
We present a technique that exploits the multiplicity of the ways a text may be encoded using an LZ77-based compression method… (More)
Is this relevant?
2004
2004
A nearly-optimal Fano-based coding algorithm
Statistical coding techniques have been used for a long time in lossless data compression, using methods such as Hu man's… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
2000
2000
PPM performance with BWT complexity: a fast and effective data compression algorithm
This paper introduces a new data compression algorithm. The goal underlying this new code design is to achieve a single lossless… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2000
2000
PPM Performance with BWT Complexity: A New Method for Lossless Data Compression
This work combines a new fast context-search algorithm with the lossless source coding models of PPM to achieve a lossless data… (More)
  • figure 1
  • table 1
Is this relevant?
1997
1997
Semantically Motivated Improvements for PPM Variants
The on-line sequence modelling algorithm `Prediction by Partial Matching' (PPM) has set the performance standard in lossless data… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
A Generalization and Improvement to PPM ' s \ Blending " 1
The best-performing method in the data compression literature for computing probability estimates of sequences on-line using a su… (More)
Is this relevant?
1997
1997
Text Compression by Context Tree Weighting
The results of an experimental study of different modifications of the context tree weighting algorithm are described. In… (More)
  • table 1
  • table 3
  • table 4
  • table 5
Is this relevant?
1996
1996
LZP: A New Data Compression Algorithm
Introduction A new compression algorithm is presented which may either be considered an improvement to dictionary coding or an… (More)
  • figure 2
  • figure 3
  • figure 4
Is this relevant?