-
41 network graph
computation graph — вычислительный граф; граф вычислений
-
42 oriented graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
-
43 path graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
-
44 processing graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
English-Russian big polytechnic dictionary > processing graph
-
45 undirected graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
English-Russian big polytechnic dictionary > undirected graph
-
46 acyclic graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
-
47 connected graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
-
48 trending graph
computation graph — вычислительный граф; граф вычислений
singular graph — сингулярный граф; вырожденный граф
English-Russian dictionary on nuclear energy > trending graph
-
49 bipartite graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
The English-Russian dictionary general scientific > bipartite graph
-
50 critical graph
graph features — свойства графа; теоретико-графовые свойства
computation graph — вычислительный граф; граф вычислений
product graph — произведение графов; граф-произведение
The English-Russian dictionary general scientific > critical graph
-
51 вычислительный граф
Большой англо-русский и русско-английский словарь > вычислительный граф
-
52 граф вычислений
Большой англо-русский и русско-английский словарь > граф вычислений
-
53 tree
1) вчт древовидная схема; древовидный дешифратор2) дерево (напр. графа) || древовидный3) крист. дендрит•- tree of given weight
- tree of objectives
- tree of statements
- abstract syntax tree
- adaptive tree
- Adel'son-Vel'ski-Landis tree
- Aronshine tree
- AVL tree
- B-tree
- balanced tree
- bifurcation tree
- binary tree
- binary searchtree
- Boolean tree
- branching tree
- Cartesian tree
- Cayley tree
- choice tree
- classification tree
- classification and regression tree
- clock tree
- cluster tree
- co-tree
- code tree
- command tree
- complement tree
- complete code tree
- computation tree
- conference tree
- countable tree
- decision tree
- decomposition tree
- deduction tree
- derivation tree
- edge-rooted tree
- equipotential tree
- existence trie tree
- fault tree
- Feigenbaum tree
- Fibonacci tree
- finite tree
- fractal tree
- game tree
- generation tree
- graph tree
- hardware tree
- hierarchical tree
- homeomorphically irreducible tree
- Husimi tree
- hypothesis search tree
- inference tree
- information tree
- labeled tree
- language tree
- lexicographic tree
- loaded fractal tree
- logical tree
- minimal tree
- minimal length tree
- multibranch tree
- multiway tree
- normal tree
- optimal tree
- optimal merge tree
- optimal search tree
- ordered tree
- oriented tree
- outcome tree
- parse tree
- parsing tree
- patricia tree
- planar tree
- plane tree
- priority tree
- priority search tree
- probability tree
- production tree
- proper tree
- proof tree
- radix tree
- randomized binary tree
- RB tree
- recursive tree
- red-black tree
- response tree
- rooted tree
- search tree
- selection tree
- shortest tree
- shortest-distance tree
- signed tree
- spanning tree
- specific tree
- subject tree
- subspanning tree
- suffix tree
- symmetric tree
- syntax tree
- ternary tree
- ternary search tree
- threaded tree
- topological tree
- transition tree
- trie tree
- two-color tree
- two-dimensional tree
- two-level tree
- unlabeled tree
- weighted tree -
54 motion
движение, ход, перемещение, подача, механизм, передвижение, такт
– motion channel
– motion composer
– motion computation
– motion control
– motion control loop
– motion correction
– motion correction resolution
– motion cycle
– motion database
– motion economy principle
– motion equation
– motion execution
– motion flow
– motion forecasting
– motion formation problem
– motion freedom
– motion generation program
– motion generation resolution
– motion generation subsystem
– motion generation system
– motion generator
– motion interference
– motion law
– motion level language
– motion material
– motion path
– motion pattern
– motion plan
– motion plane
– motion planning
– motion primitive
– motion program
– motion refinement
– motion repeatability
– motion repertoire
– motion restriction
– motion scheme
– motion screw
– motion sensing
– motion sequence
– motion sequence programming
– motion skeleton
– motion smoothing
– motion space
– motion span
– motion specification
– motion stability
– motion stabilization
– motion start
– motion study
– motion succession
– motion synthesis
– motion timing
– motion-average forecasting
– motion-planning computer
– motion-velocity graph
-
55 tree
древовидная схема, дерево1) дерево - граф, в котором существует единственный путь между двумя вершинами, т. е. связанный ациклический граф2) концептуальное или графическое представление данных, организованных в древовидную структуру, например дерево каталогов на дискеАнгло-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. > tree
-
56 process
1) процесс2) процедура3) технологический процесс || технологический4) приём, способ5) обрабатывать; перерабатывать•process with independent increments — процесс с независимыми приращениями, аддитивный процесс
process with nonstationary increments — процесс с нестационарными приращениями, неоднородный во времени процесс
process with stationary and independent increments — процесс со стационарными и независимыми приращениями, однородный процесс
- absorbing barrier process - basic oxygen process - direct reduction process - discrete process - discrete-time process - linearly singular process - locally integrable process - locally stable process - multistep process - multivariate process - N-dimensional process - partially mixing process - process of hidden periodicities - steady stochastic process - temporally homogeneous process - weakly ergodic process - weakly stationary processprocess with stationary increments — процесс со стационарными приращениями, однородный во времени процесс
-
57 processing
1. n переработка2. n стерилизация3. n технология4. n эк. вчт. обработка данных5. n обработка6. n кино лабораторная обработка киноплёнки7. n преим. амер. оформление8. n преим. амер. рассмотрение9. n преим. амер. биохим. процессингСинонимический ряд:estimation (noun) calculation; computation; counting; estimate; estimation; figuring; number crunching; reckoning
См. также в других словарях:
Graph transformation — Graph transformation, or Graph rewriting, concerns the technique to create a new graph out of an original graph using some automatic machine. It has numerous applications, ranging from software verification to layout algorithms.Graph… … Wikipedia
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Configuration graph — Configuration graphs are a theoretical tool used in computational complexity theory to prove a relation between graph reachability and complexity classes. Contents 1 Definition 2 Useful property 3 Use of this object … Wikipedia
Connected component (graph theory) — A graph with three connected components. In graph theory, a connected component of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices. For example,… … 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
Power graph analysis — In computational biology, power graph analysis is a method for the analysis andrepresentation of complex networks. Power graph analysis is the computation, analysis and visual representation of a power graph from a graphs (networks).Power graph… … Wikipedia
Feynman graph — A Feynman graph is a graph suitable to be a Feynman diagram in a particular application of quantum field theory. (The most common use is when each field has quanta (particles) associated with it as the quantum of the electromagnetic field is a… … Wikipedia
Bond graph — A bond graph is a graphical description of a physical dynamic system. It is an energy based graphical technique for building mathematical models of dynamic systems. A bond graph depicts the energy flow between components used to model a system.… … Wikipedia
Aperiodic graph — In the mathematical area of graph theory, a directed graph is said to be aperiodic if there is no integer k > 1 that divides the length of every cycle of the graph. Equivalently, a graph is aperiodic if the greatest common divisor of the lengths… … Wikipedia
Periodic graph (crystallography) — For other uses, see Periodic graph. A (large) unit cell of Diamond crystal net; the balls represent carbon atoms and the sticks represent covalent bonds … Wikipedia
Chronology of computation of π — The table below is a brief chronology of computed numerical values of, or bounds on, the mathematical constant pi (π). See the history of numerical approximations of pi for explanations, comments and details concerning some of the calculations… … Wikipedia