- topological partitioning
-
топологическое разбиение
Англо-русский словарь технических терминов. 2005.
topological partitioning
Смотреть что такое "topological partitioning" в других словарях:
Sorting algorithm — In computer science, a sorting algorithm is an algorithm that puts elements of a list in a certain order. The most used orders are numerical order and lexicographical order. Efficient sorting is important for optimizing the use of other… … Wikipedia
Integral — This article is about the concept of integrals in calculus. For the set of numbers, see integer. For other uses, see Integral (disambiguation). A definite integral of a function can be represented as the signed area of the region bounded by its… … Wikipedia
Rent's Rule — pertains to the organization of computing logic, specifically the relationship between the number of external signal connections to a logic block (i.e., the number of pins ) with the number of logic gates in the logic block, and has been applied… … Wikipedia
Cover (topology) — In mathematics, a cover of a set X is a collection of sets whose union contains X as a subset. Formally, if is an indexed family of sets Uα, then C is a cover of X if Contents 1 Cover in t … Wikipedia
Cluster analysis — The result of a cluster analysis shown as the coloring of the squares into three clusters. Cluster analysis or clustering is the task of assigning a set of objects into groups (called clusters) so that the objects in the same cluster are more… … Wikipedia
Dakosaurus — Temporal range: 157–137 Ma … Wikipedia
algebra — /al jeuh breuh/, n. 1. the branch of mathematics that deals with general statements of relations, utilizing letters and other symbols to represent specific sets of numbers, values, vectors, etc., in the description of such relations. 2. any of… … Universalium
Collective animal behavior — Sort sol. Starling flock at sunset in Denmark Collective animal behavior describes the coordinated behavior of large groups of similar animals and the emergent properties of these groups. Facets of this topic include the costs and benefits of… … Wikipedia
Merge sort — Example of merge sort sorting a list of random dots. Class Sorting algorithm Data structure Array Worst case performance O(n log n) … Wikipedia
Equivalence relation — In mathematics, an equivalence relation is a binary relation between two elements of a set which groups them together as being equivalent in some way. Let a , b , and c be arbitrary elements of some set X . Then a b or a ≡ b denotes that a is… … Wikipedia
Clique (graph theory) — A graph with 23 1 vertex cliques (its vertices), 42 2 vertex cliques (its edges), 19 3 vertex cliques (the light blue triangles), and 2 4 vertex cliques (dark blue). Six of the edges and 11 of the triangles form maximal cliques. The two dark blue … Wikipedia
