Data compression symmetry - Data compression symmetry describes how similar the computational effort is for compressing and decompressing data.
Data drift - Data drift is a change in the statistical distribution of data relative to a reference distribution.
Data parallelism - Data parallelism is a way of speeding up a computation by applying the same operation to different portions of data at the same time.
Data virtualization - Data virtualization is an approach that presents data from different systems through a shared logical access layer.
Daubechies wavelet - A Daubechies wavelet is a member of a family of compactly supported orthogonal wavelets developed by Ingrid Daubechies.
Deflate - Deflate, usually written DEFLATE, is a lossless compressed-data format that combines references to repeated data with Huffman coding.
Delta encoding - Delta encoding represents information through differences from a known reference instead of repeating the whole value or object.
Delta modulation - Delta modulation is a signal-coding technique that represents a changing signal through a sequence of small upward or downward adjustments.
Deployment - Deployment is the process of placing an AI system or component into its intended operating environment and making it available for use.
Dictionary coder - A dictionary coder is a compression method that replaces selected sequences of symbols with references to a dictionary or to previously available data.
Discrete cosine transform - The discrete cosine transform, or DCT, represents a finite sequence of real numbers as weights of cosine patterns.
Dyadic distribution - In source coding, a dyadic distribution is a discrete probability distribution whose positive probabilities are integer powers of one half, such as 1/2, 1/4...
Dynamic Markov compression - Dynamic Markov compression, or DMC, is a lossless compression approach that adaptively models the probabilities of incoming bits using a changing state...
Edge computing - Edge computing places some data processing close to the devices, people or physical processes that produce or use the data.
Elias delta coding - Elias delta coding is a self-delimiting binary code for positive integers.
Elias gamma coding - Elias gamma coding is a self-delimiting binary representation of positive integers.
Elias omega coding - Elias omega coding is a self-delimiting binary code for positive integers that recursively represents the lengths needed to describe a number.
Embedded zerotrees of wavelet transforms - Embedded zerotrees of wavelet transforms refers to the embedded zerotree wavelet, or EZW, approach to image compression introduced by Jerome Shapiro.
Entropy coding - Entropy coding is lossless coding that uses the relative likelihood of symbols or symbol sequences to represent data compactly.
Error exponent - An error exponent describes how quickly an error probability decreases on an exponential scale as the amount of information or the block length grows.
Even - Rodeh coding - Even - Rodeh coding is a self-delimiting binary code for nonnegative integers associated with Shimon Even and Michael Rodeh.
Execution monitoring - Execution monitoring is the process of observing an agent's actions and environment during plan execution to determine whether the current course of action...
Exponential-Golomb coding - Exponential-Golomb coding, often shortened to Exp-Golomb coding, is a family of self-delimiting binary codes for nonnegative integers.
Fibonacci coding - Fibonacci coding is a self-delimiting representation of positive integers based on Fibonacci numbers.
FM-index - An FM-index is a compressed full-text index developed by Paolo Ferragina and Giovanni Manzini.
Fractal compression - Fractal compression is a family of compression methods that represents data, especially images, through transformations whose repeated application...
Generation loss - Generation loss is degradation that can accumulate when media are repeatedly copied through a process that does not preserve all information.
Goal monitoring - Goal monitoring is the process of checking whether the goals an agent is currently pursuing remain the most appropriate goals to pursue.
Golomb coding - Golomb coding is a family of lossless variable-length codes for nonnegative integers.
Gradient Checkpointing - Gradient checkpointing, also commonly called activation checkpointing, is a training technique that reduces stored intermediate activations by recomputing...
Grammar-based code - A grammar-based code represents data using a formal grammar that reconstructs the original sequence through reusable rules.
Human-computer interaction - Human-computer interaction, or HCI, is the study and design of how people interact with computing systems.
Incremental encoding - In string compression, incremental encoding represents a string partly through shared content with a preceding string, commonly storing their common-prefix...
Interlaced video - Interlaced video represents a picture through fields containing alternating sets of image lines, commonly grouped as two fields per frame.
Key Value (KV) store - A key-value store is a data-storage system that associates a key with a value and supports retrieving that value using its key.
Krichevsky - Trofimov estimator - The Krichevsky - Trofimov estimator assigns probabilities to symbols in a fixed finite alphabet by adding one-half to each observed count.
Lapped transform - A lapped transform represents a signal using transform functions whose support overlaps neighboring processing blocks.
Latency - Latency is the elapsed time between a defined initiating event and a defined response or completion event.
Layered coding - Layered coding represents information through a base layer and one or more additional layers that provide further detail or capability when decoded with the...
Lempel - Ziv - Oberhumer - Lempel - Ziv - Oberhumer, usually abbreviated LZO, is a family of lossless compression methods and an associated software library designed with fast...
Lempel - Ziv - Stac - Lempel - Ziv - Stac, commonly called Stac LZS, is a lossless dictionary-based compression method that represents repeated byte strings using a sliding...
Lempel - Ziv - Storer - Szymanski - Lempel - Ziv - Storer - Szymanski, usually abbreviated LZSS, is a lossless compression approach that represents data using literal symbols and references to...
Levenshtein coding - Levenshtein coding is a variable-length binary code for nonnegative integers.
Line spectral pairs - Line spectral pairs, or LSPs, are a representation of the parameters of a linear prediction filter, widely associated with speech coding.
Linear predictive coding - Linear predictive coding, or LPC, is a method used in speech analysis and coding that models a sample as a weighted combination of preceding samples.
Log area ratio - A log area ratio, or LAR, is a transformed parameter used in speech-signal modeling and coding, commonly derived from a reflection coefficient.
Lossless compression - Lossless compression represents data in a form from which the defined original data can be recovered exactly.