sparse set
Смотреть что такое "sparse set" в других словарях:
Sparse — Sparse, a. [Compar. {Sparser}; superl. {Sparsest}.] [L. sparsus, p. p. of spargere to strew, scatter. Cf. {Asperse}, {Disperse}.] 1. Thinly scattered; set or planted here and there; not being dense or close together; as, a sparse population.… … The Collaborative International Dictionary of English
Sparse approximation — is the problem of finding a signal or vector estimate with sparseness property, that is having a small number of nonzero elements, that satisfies (approximately) a system of equations.For example, consider a linear system of equations y = Ax ,… … Wikipedia
Sparse language — In computational complexity theory, a sparse language is a formal language (a set of strings) such that the number of strings of length n in the language is bounded by a polynomial function of n . They are used primarily in the study of the… … Wikipedia
Sparse graph code — A Sparse graph code is a code which is represented by a sparse graph.Any linear code can be represented as a graph, where there are two sets of nodes a set representing the transmitted bits and another set representing the constraints that the… … Wikipedia
Sparse — Infobox Software name = Sparse caption = author = Linus Torvalds developer = Josh Triplett released = 2003 latest release version = 0.4.1 latest release date = November 13, 2007 latest preview version = latest preview date = programming language … Wikipedia
Sparse coding — The sparse code is a kind of neural code in which each item is encoded by the strong activation of a relatively small set of neurons. For each item to be encoded, this is a different subset of all available neurons.As a consequence, sparseness… … Wikipedia
Level set (data structures) — In computer science a level set data structure is designed to represent discretely sampled dynamic level sets functions.A common use of this form of data structure is in efficient image rendering.Chronological developmentsThe powerful level set… … Wikipedia
Maximal independent set — This article is about the combinatorial aspects of maximal independent sets of vertices in a graph. For other aspects of independent vertex sets in graph theory, see Independent set (graph theory). For other kinds of independent sets, see… … Wikipedia
Independent set (graph theory) — The nine blue vertices form a maximum independent set for the Generalized Petersen graph GP(12,4). In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set I of vertices … Wikipedia
Continuity set — In measure theory, a continuity set of a measure μ is any Borel set B such that The class of all continuity sets for given measure μ forms a ring.[1] Similarly, for a random variable X a set B is called continuity set if otherwise B is called the … Wikipedia
Porous set — In mathematics, a porosity is a concept in the study of metric spaces. Like the concepts of meagre and measure zero sets, porosity is a notion of a set being somehow sparse or lacking bulk ; however, porosity is not equivalent to either of the… … Wikipedia
