TOPICS
Search

Search Results for ""


8201 - 8210 of 13135 for Computational GeometrySearch Results
Chevalley's theorem, also known as the Chevalley-Waring theorem, states that if f is a polynomial in F[x_1,...,x_n], where F is a finite field of field characteristic p, and ...
Let the probabilities of various classes in a distribution be p_1, p_2, ..., p_k, with observed frequencies m_1, m_2, ..., m_k. The quantity ...
The hyperbolic cosine integral, often called the "Chi function" for short, is defined by Chi(z)=gamma+lnz+int_0^z(cosht-1)/tdt, (1) where gamma is the Euler-Mascheroni ...
The chi distribution with n degrees of freedom is the distribution followed by the square root of a chi-squared random variable. For n=1, the chi distribution is a ...
A problem asking for the shortest tour of a graph which visits each edge at least once (Kwan 1962; Skiena 1990, p. 194). For an Eulerian graph, an Eulerian cycle is the ...
Let r and s be positive integers which are relatively prime and let a and b be any two integers. Then there is an integer N such that N=a (mod r) (1) and N=b (mod s). (2) ...
Chió pivotal condensation is a method for evaluating an n×n determinant in terms of (n-1)×(n-1) determinants. It also leads to some remarkable determinant identities (Eves ...
A general class of means introduced by Italian mathematician Oscar Chisini (pronounced keeseenee) in 1929. Given a function of n variables f(x_1,...,x_n), the Chisini mean of ...
Given a symmetric positive definite matrix A, the Cholesky decomposition is an upper triangular matrix U with strictly positive diagonal entries such that A=U^(T)U. Cholesky ...
A chordless graph is a simple graph possessing no chords. A chordal graph (which possesses no chordless cycles) is not the same as (or converse of) a chordless graph (which ...
1 ... 818|819|820|821|822|823|824 ... 1314 Previous Next

...