- End density
- Конечная плотность.
Краткий толковый словарь по полиграфии. 2010.
Краткий толковый словарь по полиграфии. 2010.
Density 21.5 — is a piece of music for solo flute written by Edgard Varèse in 1936 and revised in 1946. The piece was composed at the request of Georges Barrère for the premiere of his platinum flute, the density of platinum being close to 21.5 grammes per… … Wikipedia
Density theorem for Kleinian groups — In the mathematical theory of Kleinian groups, the density conjecture of Lipman Bers, Dennis Sullivan, and William Thurston, states that every finitely generated Kleinian group is an algebraic limit of geometrically finite Kleinian groups.… … Wikipedia
Density matrix renormalization group — The density matrix renormalization group (DMRG) is a numerical variational technique devised to obtain the low energy physics of quantum many body systems with high accuracy. It was invented in 1992 by Steven R. White and it is nowadays the most… … Wikipedia
END — phot. abbr Equivalent Neutral Density … United dictionary of abbreviations and acronyms
Low-density parity-check code — In information theory, a low density parity check code (LDPC code) is an error correcting code, a method of transmitting a message over a noisy transmission channel. [David J.C. MacKay (2003) Information theory, inference and learning algorithms … Wikipedia
Multivariate kernel density estimation — Kernel density estimation is a nonparametric technique for density estimation i.e., estimation of probability density functions, which is one of the fundamental questions in statistics. It can be viewed as a generalisation of histogram density… … Wikipedia
Memory storage density — is a measure of the quantity of information bits that can be stored on a given length of track, area of surface, or in a given volume of a computer storage medium. Generally, higher density is more desirable, for it allows greater volumes of data … Wikipedia
Computer storage density — is a measure of the quantity of information bits that can be stored on a given length of track, area of surface, or in a given volume of a computer storage medium. Generally, higher density is more desirable, for it allows greater volumes of data … Wikipedia
Tensor density — A tensor density transforms as a tensor, except that it is additionally multiplied or weighted by a power of the Jacobian determinant.For example, a rank 3 tensor density of weight W transforms as::A {ijk}^prime =egin{vmatrix} alpha… … Wikipedia
Kernel density estimation — of 100 normally distributed random numbers using different smoothing bandwidths. In statistics, kernel density estimation is a non parametric way of estimating the probability density function of a random variable. Kernel density estimation is a… … Wikipedia