Search Results for ""

The equation f(x_n|x_s)=int_(-infty)^inftyf(x_n|x_r)f(x_r|x_s)dx_r which gives the transitional densities of a Markov sequence. Here, n>r>s are any integers (Papoulis 1984, ...

A clique covering of a graph G is set of cliques such that every vertex of G is a member of at least one clique. A minimum clique covering is a clique covering of minimum ...

Given an arithmetic series {a_1,a_1+d,a_1+2d,...}, the number d is called the common difference associated to the sequence.

The formal term in propositional calculus for the connective implies.

A sentence is called a contingency if its truth table contains at least one 'T' and at least one 'F.'

A sentence is called a contradiction if its truth table contains only false entries.

The surface given by the parametric equations x = e^(bv)cosv+e^(av)cosucosv (1) y = e^(bv)sinv+e^(av)cosusinv (2) z = e^(av)sinu. (3) For a=b=1, the coefficients of the first ...

The numbers lambda_(nun) in the Gaussian quadrature formula Q_n(f)=sum_(nu=1)^nlambda_(nun)f(x_(nun)).

A wavelet used for filtering signals. Daubechies (1988, p. 980) has tabulated the numerical values up to order p=10.

The digon is the degenerate polygon (corresponding to a line segment) with Schläfli symbol {2}.