Search Results for ""

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

Let G=(V,E) be a finite graph, let Omega be the set Omega={0,1}^E whose members are vectors omega=(omega(e):e in E), and let F be the sigma-algebra of all subsets of Omega. A ...

A problem also known as the points problem or unfinished game. Consider a tournament involving k players playing the same game repetitively. Each game has a single winner, ...

A theorem from information theory that is a simple consequence of the weak law of large numbers. It states that if a set of values X_1, X_2, ..., X_n is drawn independently ...

The BCH code is an error-correcting code that is a generalization of the Reed-Muller error-correcting code used by the Voyager 2 spacecraft.

A roll of 10 on a pair of six-sided dice in the game of craps (Gardner 1978, p. 256). The probability of rolling "a big Dick" is 1/12, or 8.333...%.

Given a set of objects S, a binary relation is a subset of the Cartesian product S tensor S.

If F is the Borel sigma-algebra on some topological space, then a measure m:F->R is said to be a Borel measure (or Borel probability measure). For a Borel measure, all ...

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 ...