Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Calgary corpus

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

Related topics

Related topics

10 relations
Binary dataCanterbury corpusData compressionMutual information
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Convolutional Neural Networks for Skull-stripping in Brain MR Imaging using Consensus-based Silver standard Masks
Convolutional neural networks (CNN) for medical imaging are constrained by the number of annotated data required in the training… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
2016
2016
Compression of short data blocks to improve the reliability of non-volatile flash memories
This work investigates data compression algorithms for applications in non-volatile flash memories. The main goal of the data… Expand
  • figure 2
  • figure 3
  • table I
  • table II
  • figure 4
Highly Cited
2006
Highly Cited
2006
A framework for asynchronous change awareness in collaborative documents and workspaces
Change awareness is the ability of individuals to track the asynchronous changes made to a collaborative document or graphical… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
2006
2006
Compressed by the suffix tree
  • M. Senft
  • Data Compression Conference (DCC'06)
  • 2006
    • Corpus ID: 18006376
A close inspection of Fiala and Green's implementation of Ziv-Lempel'77 dictionary compression method reveals a surprising… Expand
  • figure 1
  • figure 2
  • table 1
  • table 3
  • table 2
2005
2005
Graphs With Least Eigenvalue —2: A New Proof of the 31 Forbidden Subgraphs Theorem
Generalized line graphs were introduced by Hoffman Proc. Calgary Internat. Conf. on Combinatorial Structures and their… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2004
2004
Hydrodynamic instabilities and pattern formation in a cytoplasmic medium from yeast
1. Matile, P.: The Lytic Compartment of Plant Cells. New York: Springer 1975 2. Matile, P.: Ann. Rev. Plant Physiol. 29, 193… Expand
  • figure 1
  • figure 2
1999
1999
One attempt of a compression algorithm using the BWT
In 1994 Burrows and Wheeler [5] described a universal data compression algorithm (BW-algorithm, for short) which achieved… Expand
  • table 1
  • table 2
  • table 3
  • figure 1
  • table 4
Highly Cited
1997
Highly Cited
1997
A corpus for the evaluation of lossless compression algorithms
  • R. Arnold, T. Bell
  • Proceedings DCC '97. Data Compression Conference
  • 1997
    • Corpus ID: 1716634
A number of authors have used the Calgary corpus of texts to provide empirical results for lossless compression algorithms. This… Expand
  • table 1
  • figure 1
  • table 2
  • table 3
  • table 4
Highly Cited
1995
Highly Cited
1995
Unbounded length contexts for PPM
The prediction by partial matching (PPM) data compression scheme has set the performance standard in lossless compression of text… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 3
1992
1992
PLANNING AND DESIGN OF PARK-AND-RIDE FACILITIES FOR THE CALGARY LIGHT RAIL TRANSIT SYSTEM
Park-and-ride facilities are an integral part of the Calgary light rail transit (LRT) system. At the present time, there are… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • table 4
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE