- 업종: 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. ...
A representation of a directed graph with n vertices using an n × n matrix, where the entry at (i,j) is 1 if there is an edge from vertex i to vertex j; otherwise the entry is 0. A weighted graph may be represented using the weight as the entry. An undirected graph may be represented using the same entry in both (i,j) and (j,i) or using an upper triangular matrix.
Industry:Computer science
A representation of a region that is based on its boundary.
Industry:Computer science
A representation of a region that is based on its interior (i.e., the cells that compose it).
Industry:Computer science
A restricted Turing machine where the tape acts as a pushdown store (or stack, where only the latest element can be read), with an extra one-way read-only input tape.
Industry:Computer science
A rule that allows to compute the probability of exactly r occurrences of events A<sub>1</sub>, A<sub>2</sub>, ... , A<sub>n</sub>.
Industry:Computer science
A scheme in which each position in the hash table has a list to handle collisions. Each position may be just a link to the list (direct chaining) or may be an item and a link, essentially, the head of a list. In the latter, one item is in the table, and other colliding items are in the list.
Industry:Computer science
A scheme in which each position in the hash table has a list to handle collisions. Each position may be just a link to the list (direct chaining) or may be an item and a link, essentially, the head of a list. In the latter, one item is in the table, and other colliding items are in the list.
Industry:Computer science
A scheme in which linked lists within the hash table handle collisions. An item that collides is put in the next empty place in the array and added to the end of a list embedded in the array items. Any open addressing method to compute possible new positions may be used to find the "next" empty place.
Industry:Computer science
A scheme that chooses randomly from a set of hash functions.
Industry:Computer science
