Search Results for ""

The polynomials defined by B_(i,n)(t)=(n; i)t^i(1-t)^(n-i), (1) where (n; k) is a binomial coefficient. The Bernstein polynomials of degree n form a basis for the power ...

A biplanar graph is defined as a graph that is the graph union of two planar edge-induced subgraphs. In other words, biplanar graphs are graphs with graph thickness 1 or 2 ...

A bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board). To form the ...

Take x itself to be a bracketing, then recursively define a bracketing as a sequence B=(B_1,...,B_k) where k>=2 and each B_i is a bracketing. A bracketing can be represented ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

Given a general quadrilateral with sides of lengths a, b, c, and d, the area is given by K = 1/4sqrt(4p^2q^2-(b^2+d^2-a^2-c^2)^2) (1) = (2) (Coolidge 1939; Ivanov 1960; Beyer ...

A C-matrix is a symmetric (C^(T)=C) or antisymmetric (C^(T)=-C) C_n (-1,0,1)-matrix with diagonal elements 0 and others +/-1 that satisfies CC^(T)=(n-1)I, (1) where I is the ...

A moment mu_n of a univariate probability density function P(x) taken about the mean mu=mu_1^', mu_n = <(x-<x>)^n> (1) = int(x-mu)^nP(x)dx, (2) where <X> denotes the ...

Given a point P and a triangle DeltaABC, the Cevian triangle DeltaA^'B^'C^' is defined as the triangle composed of the endpoints of the cevians though the Cevian point P. A ...

Chebyshev noticed that the remainder upon dividing the primes by 4 gives 3 more often than 1, as plotted above in the left figure. Similarly, dividing the primes by 3 gives 2 ...