Search Results for ""

A binary tree in which special nodes are added wherever a null subtree was present in the original tree so that each node in the original tree (except the root node) has ...

A phrase used by Tukey to describe data points which are outside the outer fences.

Values one step outside the hinges are called inner fences, and values two steps outside the hinges are called outer fences. Tukey calls values outside the outer fences far ...

A finite geometry is a geometry with a finite number of points. When confined to a plane, all finite geometries are either projective plane geometries (with no parallel ...

The statistical index P_B=sqrt(P_LP_P), where P_L is Laspeyres' index and P_P is Paasche's index.

A balanced incomplete block design (v, k, lambda, r, b) exists only for b>=v (or, equivalently, r>=k).

Given T an unbiased estimator of theta so that <T>=theta. Then var(T)>=1/(Nint_(-infty)^infty[(partial(lnf))/(partialtheta)]^2fdx), where var is the variance.

Let r be the correlation coefficient. Then defining z^'=tanh^(-1)r (1) zeta=tanh^(-1)rho, (2) gives sigma_(z^') = (N-3)^(-1/2) (3) var(z^') = 1/n+(4-rho^2)/(2n^2)+... (4) ...

A graph G is said to be flexible if the vertices of G can be moved continuously so that (1) the distances between adjacent vertices are unchanged, and (2) at least two ...

Let four lines in a plane represent four roads in general position, and let one traveler T_i be walking along each road at a constant (but not necessarily equal to any other ...