- Settore: Technology
- Number of terms: 2742
- Number of blossaries: 0
- Company Profile:
The National Institute of Standards and Technology (NIST) — known between 1901 and 1988 as the National Bureau of Standards (NBS) — is a measurement standards laboratory and a non-regulatory agency of the United States Department of Commerce. The institute's official mission is to promote U.S. ...
For a given match, this is the number of matches in a longest chain terminating with that match, inclusive.
Industry:Computer science
For a given variant of the Steiner tree problem, the maximum possible ratio of the length of a minimum spanning tree of a set of terminals to the length of an optimal Steiner tree of the same set of terminals. Usually written ρ (rho).
Industry:Computer science
For a path system P=(x,R,S,T), where S⊆ X, T ⊆ X, and R⊆ X × X × X, the problem of whether there is an admissible vertex in S. A vertex is admissible if and only if x∈ T, or there exists admissible y, z ∈ X such that (x,y,z) ∈ R.
Industry:Computer science
For any set H of n hyperplanes in R<sup>k</sup>, and any parameter r, 1 ≤ r≤ n, there always exists a (1/r)-cutting of size O(r<sup>k</sup>). In two dimensions, a (1/r)-cutting of size s is a partition of the plane into s disjoint triangles, some of which are unbounded, such that no triangle in the partition intersects more than n/r lines in H. In R<sup>k</sup>, triangles are replaced by simplices. Such a cutting can be computed in O(nr<sup>k-1</sup>) time.
Industry:Computer science
For each position in a string, the inverse suffix array has its index in the string's suffix array. Formal Definition: Given a suffix array, sa, and the corresponding inverse suffix array, isa, isa(i) = j iff sa(j) = i.
Industry:Computer science
For large values of n, (n/e)<sup>n</sup> √(2nπ) < n! < (n/e)<sup>n</sup>(1 + 1/(12n-1)) √(2nπ).
Industry:Computer science
For large values of n, n! ≈ (n/e)<sup>n</sup> √(2nπ).
Industry:Computer science
For two elements e<sub>i</sub> and e<sub>j</sub>, the locus of points equidistant from e<sub>i</sub> and e<sub>j</sub>. That is (p
Industry:Computer science
For two vectors X and Y, and with respect to two suitable operations ⊗ and ⊕ is a vector Z=Z<sub>0</sub> Z<sub>1</sub> ... Z<sub>m+n</sub> where Z<sub>k</sub>=⊕<sub>i+j=k</sub>X<sub>i</sub> ⊗ Y<sub>j</sub> (k=0, ... , m+n).
Industry:Computer science
Generate all nodes in a game tree. Score each leaf node with its utility value. Score each minimizing node with the smallest of its children's scores, and maximizing node with the largest of its children's scores.
Industry:Computer science
