Search Results for ""

Hadamard's maximum determinant problem asks to find the largest possible determinant (in absolute value) for any n×n matrix whose elements are taken from some set. Hadamard ...

This problem is NP-complete (Garey and Johnson 1983).

The score function u(theta) is the partial derivativeof the log-likelihood function F(theta)=lnL(theta), where L(theta) is the standard likelihood function. Defining the ...

Define T as the set of all points t with probabilities P(x) such that a>t=>P(a<=x<=a+da)<P_0 or a<t=>P(a<=x<=a+da)<P_0, where P_0 is a point probability (often, the ...

The multiplicity of a multigraph is its maximum edge multiplicity.

The bandwidth of a matrix M=(m_(ij)) is the maximum value of |i-j| such that m_(ij) is nonzero.

A minimization of the maximum error for a fixed number of terms.

A matching is a maximum matching iff it contains no augmenting path.

The conjecture that the maximum local density is given by rho_(dodecahedron).

The apodization function A(x)=cos((pix)/(2a)). Its full width at half maximum is 4a/3. Its instrument function is I(k)=(4acos(2piak))/(pi(1-16a^2k^2)), which has a maximum of ...