- arbitrary distance
- произвольное расстояние, произвольно выбранное расстояние
Англо-русский строительный словарь. 2013.
arbitrary distance
Смотреть что такое "arbitrary distance" в других словарях:
Distance of closest approach of ellipses and ellipsoids — The distance of closest approach of two objects is the distance between their centers when they are externally tangent. The objects may be geometric shapes or physical particles with well defined boundaries. The distance of closest approach is… … Wikipedia
Distance correlation — In statistics and in probability theory, distance correlation is a measure of statistical dependence between two random variables or two random vectors of arbitrary, not necessarily equal dimension. Its important property is that this measure of… … Wikipedia
Distance from a point to a line — The distance from a point to a line is the shortest distance from a point to a line in Euclidean geometry. It can be calculated in the following ways. Contents 1 Cartesian coordinates 2 Vector formulation 3 Proof 1 (algebraic proof) … Wikipedia
Distance measures (cosmology) — Physical cosmology Universe · Big Bang … Wikipedia
Arbitrary constant — Constant Con stant, n. 1. That which is not subject to change; that which is invariable. [1913 Webster] 2. (Math.) A quantity that does not change its value; used in countradistinction to {variable}. [1913 Webster] 3. (Astron.) A number whose… … The Collaborative International Dictionary of English
Comoving distance — Physical cosmology Universe · Big Bang … Wikipedia
Hausdorff distance — The Hausdorff distance, or Hausdorff metric, measures how far two compact non empty subsets of a metric space are from each other. It is named after Felix Hausdorff.Informally, the Hausdorff distance between two sets of points, is the longest… … Wikipedia
Cosmic distance ladder — * Light green boxes: Technique applicable to star forming galaxies. * Light blue boxes: Technique applicable to Population II galaxies. * Light Purple boxes: Geometric distance technique. * Light Red box: The planetary nebula luminosity function… … Wikipedia
Damerau–Levenshtein distance — In information theory and computer science, the Damerau–Levenshtein distance (named after Frederick J. Damerau and Vladimir I. Levenshtein) is a distance (string metric) between two strings, i.e., finite sequence of symbols, given by counting the … Wikipedia
Resistance distance — In graph theory, the resistance distance between two vertices of a simple connected graph, G , is equal to the resistance between two equivalent points on an electrical network, constructed so as to correspond to G , with each edge being replaced … Wikipedia
Inverse distance weighting — (IDW) is a method for multivariate interpolation, a process of assigning values to unknown points by using values from usually scattered set of known points. A general form of finding an interpolated value u for a given point x using IDW is an… … Wikipedia
