Lossless predictive audio compression - Lossless predictive audio compression refers here to LPAC, a historical audio-coding system associated with Tilman Liebchen and research at the Technical...
Lossy compression - Lossy compression reduces the representation of data by allowing some information to be discarded or approximated.
Lossy data conversion - Lossy data conversion changes data from one representation to another in a way that prevents complete recovery of the original information from the...
LZ4 (compression algorithm) - LZ4 is a lossless compression algorithm designed with an emphasis on fast compression and decompression.
LZFSE - LZFSE is a lossless data-compression algorithm that combines Lempel - Ziv-style matching with Finite State Entropy coding.
LZMA - LZMA, short for Lempel - Ziv - Markov chain algorithm, is a lossless compression method that combines dictionary-based matching with probabilistic coding.
LZRW - LZRW refers to a family of lossless compression algorithms associated with Ross Williams, including variants such as LZRW1 and LZRW3.
LZWL - LZWL is a syllable-based variant of Lempel - Ziv - Welch, or LZW, text compression.
Macroblock - A macroblock is a coding unit used in several block-based video-compression designs, including H.264/AVC.
Model Deployment - Model deployment is the process of making a trained model available in an operating environment where an application can use it for inference.
Model parallelism - Model parallelism distributes parts of a model's computation across multiple processing devices.
Model Registry - A model registry is a system for organizing named machine-learning models, their versions, and associated metadata so that teams can identify, retrieve, and...
Modified discrete cosine transform - The modified discrete cosine transform, or MDCT, is a lapped time-frequency transform used in audio coding.
Modified Huffman coding - Modified Huffman coding, or MH, is a one-dimensional lossless run-length coding method associated with bilevel facsimile images.
Modulo-N code - Modulo-N coding represents a value by its remainder after division by N and uses correlated information at the decoder to help recover the intended value.
Motion compensation - Motion compensation uses motion information to form a prediction of image content from one or more reference images.
Move-to-front transform - The move-to-front transform, or MTF, is a reversible transformation that replaces each input symbol with its current position in an ordered list, then moves...
Multi-output - Multi-output describes a prediction problem in which each input example has more than one target value, such as several numerical measurements or...
Negafibonacci coding - Negafibonacci coding represents nonzero signed integers using Fibonacci numbers with negative indices, then turns that representation into a self-delimiting...
Nyquist - Shannon sampling theorem - The Nyquist - Shannon sampling theorem describes when a continuous, band-limited signal can be reconstructed from uniformly spaced samples.
Offline Store - An offline store is the part of a feature-store architecture used to retain and retrieve historical feature values for work such as model training and batch...
Online Store - An online store is the part of a feature-store architecture designed to retrieve feature values quickly for prediction requests, usually using one or more...
OR-parallelism - OR-parallelism explores alternative solutions concurrently.
Output gate - An output gate is a learned control in a long short-term memory network, or LSTM, that regulates how much of the transformed cell state contributes to the...
Parameter Server - A parameter server is a component of a distributed machine-learning system that stores and manages shared model parameters while worker processes perform...
Plan monitoring - Plan monitoring is checking whether the remaining part of an agent's current plan can still achieve its intended goal given the latest relevant information.
Point-in-Time Correct Joins - Point-in-time correct joins combine observations with feature values appropriate to each observation's reference time, rather than attaching whichever...
Prediction by partial matching - Prediction by partial matching, or PPM, is an adaptive statistical approach to lossless compression that predicts the next symbol from preceding symbols.
Prefix code - A prefix code is a set of codewords in which no complete codeword is the beginning of another distinct codeword.
Query Engines - Query engines are software components that interpret requests for data, plan how to carry out those requests, and execute operations that produce results.
Range coding - Range coding is a lossless entropy-coding technique that represents a sequence of symbols by progressively narrowing a numerical interval.
Re-Pair - Re-Pair, short for recursive pairing, is a lossless grammar-based compression method that repeatedly replaces a frequent adjacent pair of symbols with a new...
Reassignment method - The reassignment method is a signal-analysis technique that relocates values in a time - frequency or time - scale representation to better estimated...
Recommender System - A recommender system selects or orders items that may be useful or relevant to a user in a particular context.
Recursive indexing - Recursive indexing is a numerical encoding technique that represents a value outside a small symbol range as a sequence of in-range symbols.
Run-length encoding - Run-length encoding, or RLE, is a lossless compression technique that replaces a consecutive sequence of repeated values with a description of the value and...
Sardinas - Patterson algorithm - The Sardinas - Patterson algorithm determines whether a finite set of variable-length codewords is uniquely decodable.
SDCH - SDCH stands for Shared Dictionary Compression over HTTP.
Sequitur algorithm - Sequitur is an incremental algorithm that discovers repeated structure in a sequence of discrete symbols by building a hierarchical grammar.
Serving - Serving is the process of making a trained machine-learning model available to produce predictions for an application or workflow.
Set partitioning in hierarchical trees - Set partitioning in hierarchical trees, usually abbreviated SPIHT, is an image-coding method that efficiently describes wavelet-transform coefficients by...
Set redundancy compression - Set redundancy compression refers to methods that exploit information shared across a collection of similar data items, especially images.
Shannon coding - Shannon coding is a method for constructing a variable-length, prefix-free code from symbol probabilities.
Shannon - Fano coding - Shannon - Fano coding commonly refers to a variable-length prefix-code construction that sorts symbols by probability and repeatedly splits them into two...
Shannon - Fano - Elias coding - Shannon - Fano - Elias coding is a prefix-code construction that assigns each symbol a probability interval, takes that interval's midpoint, and represents...
Shannon's source coding theorem - Shannon's source coding theorem establishes entropy as the fundamental rate limit for lossless compression under an appropriate source model.