Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 219,937,496 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
10 relations
Binary data
Canterbury corpus
Data compression
Mutual information
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Compression of short data blocks to improve the reliability of non-volatile flash memories
Tobias Ahrens
,
Mohammed Rajab
,
J. Freudenberger
International Design and Test Workshop/Symposium
2016
Corpus ID: 18141957
This work investigates data compression algorithms for applications in non-volatile flash memories. The main goal of the data…
Expand
Review
2014
Review
2014
Modeling And Analysis Of Rainwater Harvesting Systems Under Different Climates
Ahmed El Ganzouri
2014
Corpus ID: 127664896
Rainwater harvesting has the potential to alleviate some of the stress on the current water supply infrastructure. A deeper…
Expand
2013
2013
Improving block sorting compression using Simulated Annealing
J. Platoš
World Congress on Nature and Biologically…
2013
Corpus ID: 18450616
Data compression becomes a common technique with large data processing these days. Burrows-Wheeler transformation is one of the…
Expand
2011
2011
A New Perspective on List Update: Probabilistic Locality and Working Set
Reza Dorrigiv
,
A. López-Ortiz
Workshop on Approximation and Online Algorithms
2011
Corpus ID: 6583034
In this paper we study the performance of list update algorithms under arbitrary distributions that exhibit strict locality of…
Expand
Review
2008
Review
2008
Pushing the resolution limits: The Priddis 3C-2D survey
D. Henley
,
K. Hall
,
M. Bertram
,
E. Gallant
2008
Corpus ID: 54209154
As improvements continue to be made in seismic acquisition equipment, particularly in the number of independent channels which…
Expand
2006
2006
Compressed by the suffix tree
M. Senft
Data Compression Conference
2006
Corpus ID: 18006376
A close inspection of Fiala and Green's implementation of Ziv-Lempel'77 dictionary compression method reveals a surprising…
Expand
2005
2005
Graphs With Least Eigenvalue —2: A New Proof of the 31 Forbidden Subgraphs Theorem
D. Cvetkovic
,
P. Rowlinson
,
S. Simic
Des. Codes Cryptogr.
2005
Corpus ID: 26870967
Generalized line graphs were introduced by Hoffman Proc. Calgary Internat. Conf. on Combinatorial Structures and their…
Expand
1999
1999
Dictionary Selection Using Partial Matching
Dzung T. Hoang
,
Philip M. Long
,
J. Vitter
Information Sciences
1999
Corpus ID: 11614939
1999
1999
One attempt of a compression algorithm using the BWT
B. Balkenhol
,
Y. Shtarkov
1999
Corpus ID: 18164136
In 1994 Burrows and Wheeler [5] described a universal data compression algorithm (BW-algorithm, for short) which achieved…
Expand
1984
1984
Hydrodynamic instabilities and pattern formation in a cytoplasmic medium from yeast
S. Müller
,
T. Plesser
,
B. Hess
SCIENCE NATURE
1984
Corpus ID: 40463776
1. Matile, P.: The Lytic Compartment of Plant Cells. New York: Springer 1975 2. Matile, P.: Ann. Rev. Plant Physiol. 29, 193…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE