- partitioned decomposition
- декомпозиция разбиением
Большой англо-русский и русско-английский словарь. 2001.
partitioned decomposition
Смотреть что такое "partitioned decomposition" в других словарях:
разбиение на модули — — [Л.Г.Суменко. Англо русский словарь по информационным технологиям. М.: ГП ЦНИИС, 2003.] Тематики информационные технологии в целом EN modular decompositionmodularizationpartitioned decomposition … Справочник технического переводчика
Banach–Tarski paradox — The Banach–Tarski paradox is a theorem in set theoretic geometry which states that a solid ball in 3 dimensional space can be split into several non overlapping pieces, which can then be put back together in a different way to yield two identical … Wikipedia
Dilworth's theorem — In mathematics, in the areas of order theory and combinatorics, Dilworth s theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician … Wikipedia
Split graph — In graph theory, a split graph is a graph in which the vertices can be partitioned into a clique and an independent set. Split graphs were first studied by Földes and Hammer in two papers in 1977, and independently introduced by Tyshkevich and… … Wikipedia
Block matrix pseudoinverse — is a formula of pseudoinverse of a partitioned matrix. This is useful for decomposing or approximating many algorithms updating parameters in signal processing, which are based on least squares method. Derivation Consider a column wise… … Wikipedia
Block matrix — In the mathematical discipline of matrix theory, a block matrix or a partitioned matrix is a matrix broken into sections called blocks. Looking at it another way, the matrix is written in terms of smaller matrices.[1] We group the rows and… … Wikipedia
Degeneracy (graph theory) — In graph theory, a k degenerate graph is an undirected graph in which every subgraph has a vertex of degree at most k: that is, some vertex in the subgraph touches k or fewer of the subgraph s edges. The degeneracy of a graph is the smallest… … Wikipedia
Poland — /poh leuhnd/, n. a republic in E central Europe, on the Baltic Sea. 38,700,291; ab. 121,000 sq. mi. (313,400 sq. km). Cap.: Warsaw. Polish, Polska. * * * Poland Introduction Poland Background: Poland is an ancient nation that was conceived around … Universalium
GEOGRAPHICAL SURVEY — Names The name Ereẓ Israel (the Land of Israel) designates the land which, according to the Bible was promised as an inheritance to the Israelite tribes. In the course of time it came to be regarded first by the Jews and then also by the… … Encyclopedia of Judaism
Arboricity — The arboricity of an undirected graph is the minimum number of forests into which its edges can be partitioned. Equivalently it is the minimum number of spanning trees needed to cover all the edges of the graph.ExampleThe figure shows the… … Wikipedia
Point location — The point location problem is a fundamental topic of computational geometry. It finds applications in areas that deal with processing geometrical data: computer graphics, geographic information systems (GIS), motion planning, and computer aided… … Wikipedia
