- directed structure
- мат. направленная структура
Большой англо-русский и русско-английский словарь. 2001.
Большой англо-русский и русско-английский словарь. 2001.
Structure tensor — Structure tensors (or second moment matrices) are matrix representations of partial derivatives. In the field of image processing and computer vision, they are typically used to represent gradients, edges or similar information. Structure tensors … Wikipedia
Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i … Wikipedia
Structure editor — A structure editor, also structured editor, is any document editor that is cognizant of the document’s underlying structure. Structure editors can be used to edit hierarchical or marked up text, computer programs, diagrams, chemical formulas, and … Wikipedia
Directed acyclic word graph — For the US Department of Defense review panel, see Deputy’s Advisory Working Group. The strings tap , taps , top , and tops stored in a Trie (left) and a DAWG (right), EOW stands for End of word. In computer science, a directed acyclic word graph … Wikipedia
Structure of the Comecon — See also the main article Comecon. Comecon, a Cold War Eastern Bloc equivalent to the European Economic Community, had an elaborate organisational structure, as laid out below. The Conference Although not formally part of the organization s… … Wikipedia
directed acyclic word graph — noun A data structure that represents a set of strings and allows for a query operation that tests whether a given string belongs to the set in time proportional to its length (thus more efficient in some situations than a trie). Syn: DAWG … Wiktionary
Causal structure — This article is about the possible causal relationships among points in a Lorentzian manifold. For classification of Lorentzian manifolds according to the types of causal structures they admit, see Causality conditions. In mathematical physics,… … Wikipedia
Tree (data structure) — A simple unordered tree; in this diagram, the node labeled 7 has two children, labeled 2 and 6, and one parent, labeled 2. The root node, at the top, has no parent. In computer science, a tree is a widely used data structure that emulates a… … Wikipedia
Nucleic acid structure determination — This article is about the experimental determination of nucleic acid structure. For computational methods, see Nucleic acid structure prediction. Structure probing of nucleic acids is the process by which biochemical techniques are used to… … Wikipedia
Data structure — In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently.[1][2] Different kinds of data structures are suited to different kinds of applications, and some are highly … Wikipedia
Heap (data structure) — This article is about the programming data structure. For the dynamic memory area, see Dynamic memory allocation. Example of a complete binary max heap In computer science, a heap is a specialized tree based data structure that satisfies the heap … Wikipedia