842 (compression algorithm) - 842, also written 8-4-2, is a lossless data-compression scheme that represents data using small templates containing literal bytes and references to...
A-law algorithm - A-law is a companding law used to represent audio samples with nonuniform quantization, notably in the G.711 telephony standard.
Action monitoring - Action monitoring is the practice of checking whether the conditions required for the next planned action still hold before attempting it, and detecting...
Adaptive compression - Adaptive compression is compression that changes its model or coding decisions in response to the data being processed.
Adaptive differential pulse-code modulation - Adaptive differential pulse-code modulation (ADPCM) is a family of audio-coding methods that represents the difference between a sample and its predicted...
Adaptive Huffman coding - Adaptive Huffman coding is lossless compression that changes a Huffman code tree as symbols are processed.
Algebraic code-excited linear prediction - Algebraic code-excited linear prediction (ACELP) is a speech-coding approach that represents speech using a prediction filter and a compact, mathematically...
Algorithm BSTW - Algorithm BSTW is a lossless data-compression scheme associated with Jon Bentley, Daniel Sleator, Robert Tarjan and Victor Wei.
Anamorphic stretch transform - The anamorphic stretch transform (AST) is a signal transformation that uses deliberately nonuniform stretching to reshape a signal for acquisition or...
AND-parallelism - AND-parallelism means solving required subproblems concurrently when their results must all contribute to the overall solution.
Arithmetic coding - Arithmetic coding is a lossless entropy-coding method that represents a sequence of symbols by progressively narrowing a numerical interval according to a...
Asymmetric numeral systems - Asymmetric numeral systems (ANS) are a family of lossless entropy-coding methods that represent symbols by reversible changes to an integer state and a...
Audio codec - An audio codec is a method, together with an implementation of that method, for encoding and decoding digital audio.
Autonomic computing - Autonomic computing is an approach to building computing systems that manage aspects of their own operation according to human-defined goals and policies.
Average bitrate - Average bitrate is the total number of bits used or transferred divided by the elapsed duration, usually expressed in bits per second.
Binary Ordered Compression for Unicode - Binary Ordered Compression for Unicode (BOCU) is a Unicode text-compression approach designed to preserve code-point ordering in the encoded byte...
Bit rate - Bit rate is the number of binary digits, or bits, transferred or represented per unit of time, normally measured in bits per second.
Bitstream format - A bitstream format is the set of rules that defines how information is arranged and interpreted in a sequence of bits.
Brotli - Brotli is a general-purpose lossless compression format and algorithm family for representing data in fewer bytes when its patterns permit.
Burrows - Wheeler transform - The Burrows - Wheeler transform (BWT) is a reversible rearrangement of a block of symbols that can make the block easier to compress.
Canonical Huffman code - A canonical Huffman code is a Huffman-style prefix code whose bit patterns are assigned by a fixed ordering rule once each symbol's code length is known.
CDR coding - CDR coding is a technique for reducing the memory occupied by Lisp list cells.
Checkpoint - A checkpoint is a saved representation of a computation's state at a particular point.
Checkpointing - Checkpointing is the process of saving a computation's recoverable state at selected points so that work can resume after interruption.
Chroma subsampling - Chroma subsampling reduces the spatial resolution of an image's color-difference components while retaining a more detailed luma component.
Cloud computing - Cloud computing provides computing resources as network-accessible services that users can obtain and release on demand.
Cloud resource elasticity - Cloud resource elasticity is the ability to expand and release computing resources as demand changes.
Code-excited linear prediction - Code-excited linear prediction, or CELP, is a speech-coding approach that represents speech using a predictive synthesis filter driven by a selected...
Coding tree unit - A coding tree unit, or CTU, is a top-level picture-partitioning unit used in video coding, notably HEVC.
Cognitive computing - Cognitive computing is a broad term for computing approaches intended to support tasks associated with human cognition, such as interpreting language...
Color space - A color space is a defined system for representing colors with numerical coordinates and an interpretation of those coordinates.
Companding - Companding combines compression and expansion of a signal's amplitude range.
Compressed data structure - A compressed data structure stores information in a space-efficient representation while supporting useful operations without first expanding the entire...
Compressed pattern matching - Compressed pattern matching searches for a pattern in data represented in compressed form, using the compression structure or a suitable index to avoid...
Compressed suffix array - A compressed suffix array is a space-efficient representation supporting operations associated with a suffix array, such as searching a text for a pattern...
Compression artifact - A compression artifact is an unwanted change in reconstructed media caused by a compression process, especially lossy coding.
Compute - Compute is the processing capability or computational work used to run software.
Constant bitrate - Constant bitrate, or CBR, is a coding or delivery mode designed to maintain a specified bit consumption or output rate over the relevant interval and buffer...
Consumer group - A consumer group is a set of consumers that cooperate to read and process data from subscribed topics.
Containerization - Containerization is the practice of packaging an application and its required software environment into a container image and running it as an isolated...
Context-adaptive binary arithmetic coding - Context-adaptive binary arithmetic coding, or CABAC, is an entropy-coding method that represents binary decisions using probability models adapted to their...
Context mixing - Context mixing is a compression technique that combines predictions from several statistical models to estimate the next symbol or bit.
Context tree weighting - Context tree weighting, or CTW, is a sequential prediction and lossless-compression method that efficiently combines probability models with different...
Continuous multi-output - Continuous multi-output describes a regression task in which each input example has more than one numerical target value.
Curve-fitting compaction - Curve-fitting compaction represents a sequence or curve using a mathematical expression and its parameters instead of storing every original point.
DAG Processing Model - A DAG processing model represents a computation or workflow as a directed acyclic graph: nodes describe work, directed edges describe dependencies, and no...
Data-Centric ML - Data-centric ML is an approach to improving machine-learning systems through systematic work on the data they use.
Data compression ratio - Data compression ratio compares the size of data before and after compression.