Search Results for ""

A set of vectors in Euclidean n-space is said to satisfy the Haar condition if every set of n vectors is linearly independent (Cheney 1999). Expressed otherwise, each ...

Let a hotel have a denumerable set of rooms numbered 1, 2, 3, .... Then any finite number n of guests can be accommodated without evicting the current guests by moving the ...

Assume X, Y, and Z are lotteries. Denote "X is preferred to Y" as X≻Y, and indifference between them by X∼Y. One version of the probability axioms are then given by the ...

Let P=p:q:r and U=u:v:w be points in trilinear coordinates, neither of which is on a side line of a reference triangle DeltaABC. Them the P-isoconjugate of U is the point ...

An algorithm for partitioning (or clustering) N data points into K disjoint subsets S_j containing N_j data points so as to minimize the sum-of-squares criterion ...

Levenberg-Marquardt is a popular alternative to the Gauss-Newton method of finding the minimum of a function F(x) that is a sum of squares of nonlinear functions, ...

A longimeter is a transparent sheet of plastic with a regular grid of lines inclined at an angle of 30 degrees to the sides of the sheet. By counting the number of squares ...

A sequence of random variates X_0, X_1, ... with finite means such that the conditional expectation of X_(n+1) given X_0, X_1, X_2, ..., X_n is equal to X_n, i.e., ...

A minimum edge cut of a graph is an edge cut of smallest possible size. The size of a minimum edge cut in a connected graph G is called the graph's edge connectivity ...

Two integers n and m<n are (alpha,beta)-multiamicable if sigma(m)-m=alphan and sigma(n)-n=betam, where sigma(n) is the divisor function and alpha,beta are positive integers. ...