Search Results for ""

On a computer screen, the pixels indicating a slanted line are selected with Bresenham's algorithm, developed in 1962 while at IBM.

A sum of the digits in a given transmission modulo some number. The simplest form of checksum is a parity bit appended on to 7-bit numbers (e.g., ASCII characters) such that ...

A compactum (plural: compacta) is a compact metric space. An example of a compactum is any finite discrete metric space. Also, the space [0,1] union [2,3] is a compactum, ...

The Cox configuration is a (2^(d-1))_d configuration whose Levi graph is the d-hypercube graph.

The Coxeter configuration is a 12_3 configuration whose Levi graph is the Nauru graph.

Discrepancy is a measure of the deviation of a point set from a uniform distribution. In general, the computation of the discrepancy of a point set is computationally ...

A property that passes from a topological space to all its quotient spaces. This is true for connectedness, local connectedness and separability, but not for any of the ...

A distribution of values of a discrete variate represented graphically by plotting points (x_1,f_1), (x_2,f_2), ..., (x_k,f_k), and drawing a set of straight line segments ...

The indefinite summation operator Delta^(-1) for discrete variables, is the equivalent of integration for continuous variables. If DeltaY(x)=y(x), then Delta^(-1)y(x)=Y(x).

The maximum degree, sometimes simply called the maximum degree, of a graph G is the largest vertex degree of G, denoted Delta.