- Branche: 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. ...
An area of storage where items with a common property are stored. Typically tree data structures and sort algorithms use many buckets, one for each group of items. Usually buckets are kept on disk.
Industry:Computer science
An array of all starting positions of suffixes of a string arranged in lexicographical order. This allows a binary search or fast substring search.
Industry:Computer science
An array of bits. A bit vector can often be handled very efficiently since a computer word is an array of bits.
Industry:Computer science
An array whose items are kept sorted, often so searching is faster.
Industry:Computer science
An array whose items have some order. Usually, it means a sorted array, but may mean not fully ordered, for example, all values less than the median are in the first half.
Industry:Computer science
An array whose size may change over time. Items are not only added or removed, but memory used changes, too. For instance, <tt>REDIM</tt> in Visual Basic or <tt>malloc()</tt> in C. In some languages, such as Perl, all arrays are dynamic.
Industry:Computer science
An assemblage of items that are randomly accessible by integers, the index. Formal Definition: Ignoring size an array may be seen as an abstract data type with the operations new(), set(i, v, A), and get(i, A), where i is a numeric index, v is a value, and A is an array. The operations may be defined with axiomatic semantics as follows. <ol> <li>new() returns an array <li>get(i, set(i, v, A)) = v <li>get(i, set(j, v, A)) = get(i, A) if i ≠ j </ol> Compare this with a dictionary using integers as keys.
Industry:Computer science
An assignment of colors (or any distinct marks) to the edges of a graph. A coloring is a proper coloring if no two adjacent edges have the same color.
Industry:Computer science
An assignment of colors (or any distinct marks) to the vertices of a graph. Strictly speaking, a coloring is proper if no two adjacent vertices have the same color.
Industry:Computer science
An assignment of flow values to the edges of a flow network that satisfies flow conservation, skew symmetry, and capacity constraints.
Industry:Computer science
