- determining set
- мат. определяющее множество
Большой англо-русский и русско-английский словарь. 2001.
determining set
Смотреть что такое "determining set" в других словарях:
Determining the number of clusters in a data set — Determining the number of clusters in a data set, a quantity often labeled k as in the k means algorithm, is a frequent problem in data clustering, and is a distinct issue from the process of actually solving the clustering problem. For a certain … Wikipedia
Set (mathematics) — This article gives an introduction to what mathematicians call intuitive or naive set theory; for a more detailed account see Naive set theory. For a rigorous modern axiomatic treatment of sets, see Set theory. The intersection of two sets is… … Wikipedia
Determining — Determine De*ter mine, v. t. [imp. & p. p. {Determined}; p. pr. & vb. n. {Determining}.] [F. d[ e]terminer, L. determinare, determinatum; de + terminare limit, terminus limit. See {Term}.] 1. To fix the boundaries of; to mark off and separate.… … The Collaborative International Dictionary of English
set gage — noun : a gage for determining the set of sawteeth … Useful english dictionary
Naive set theory — This article is about the mathematical topic. For the book of the same name, see Naive Set Theory (book). Naive set theory is one of several theories of sets used in the discussion of the foundations of mathematics.[1] The informal content of… … Wikipedia
Mandelbrot set — Initial image of a Mandelbrot set zoom sequence with a continuously coloured environment … Wikipedia
Instruction set — An instruction set, or instruction set architecture (ISA), is the part of the computer architecture related to programming, including the native data types, instructions, registers, addressing modes, memory architecture, interrupt and exception… … Wikipedia
Hayes command set — The Hayes command set is a specific command language originally developed for the Hayes Smartmodem 300 baud modem in 1981. The command set consists of a series of short text strings which combine together to produce complete commands for… … Wikipedia
Disjoint-set data structure — In computing, a disjoint set data structure is a data structure that keeps track of a set of elements partitioned into a number of disjoint (nonoverlapping) subsets. A union find algorithm is an algorithm that performs two useful operations on… … Wikipedia
Level set method — The level set method (sometimes abbreviated as LSM) is a numerical technique for tracking interfaces and shapes. The advantage of the level set method is that one can perform numerical computations involving curves and surfaces on a fixed… … Wikipedia
Edge dominating set — Examples of edge dominating sets. In graph theory, an edge dominating set for a graph G = (V, E) is a subset D ⊆ E such that every edge not in D is adjacent to at least one edge in D. An edge dominating set is also known… … Wikipedia
