Data compression

Known as: Video compression, Compression software, File compression 
In signal processing, data compression, source coding,or bit-rate reduction involves encoding information using fewer bits than the original… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1950-2017
0500100019502016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2003
Highly Cited
2003
Wireless transmission of a single bit can require over 1000 times more energy than a single computation. It can therefore be… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Caching and prefetching are important mechanisms for speeding up access time to data on secondary storage. Recent work in… (More)
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
1993
Highly Cited
1993
An important issue that affects response time performance in current OODB and hypertext systems is the I/O involved in moving… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
The charter of SRC is to advance both the state of knowledge and the state of the art in computer systems. From our establishment… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
1987
Highly Cited
1987
The state of the art in data compression is arithmetic coding, not the better-known Huffman method. Arithmetic coding gives… (More)
  • table I
  • figure 1
  • figure 2
  • figure 4
  • figure 4
Is this relevant?
Highly Cited
1986
Highly Cited
1986
A data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals… (More)
  • table I
  • figure 1
  • figure 2
  • figure 4
  • figure 3
Is this relevant?
Highly Cited
1984
Highly Cited
1984
The recently developed technique of arithmetic coding, in conjunction with a Markov model of the source, is a powerful method of… (More)
  • table I
  • figure 2
  • figure 3
  • table 111
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Trans. Inform. Theory, vol. IT-23, pp. 343-353, May 1977. [4] H. H. Tan, “Tree encoding of discrete-time abstract-alphabet… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1982
Highly Cited
1982
A general model for data compression which includes most data compression systems in the fiterature as special cases is presented… (More)
Is this relevant?
Highly Cited
1977
Highly Cited
1977
A universal algorithm for sequential data compression is presented. Its performance is investigated with respect to a… (More)
Is this relevant?