TOPICS
Search

Search Results for ""


481 - 490 of 1015 for Computational AlgorithmsSearch Results
A unit of angular measure in which the angle of an entire circle is 400 gradians. A right angle is therefore 100 gradians. A gradian is sometimes also called a gon or a grade.
The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...
Let K be an algebraically closed field and let I be an ideal in K(x), where x=(x_1,x_2,...,x_n) is a finite set of indeterminates. Let p in K(x) be such that for any ...
A polynomial map phi_(f), with f=(f_1,...,f_n) in (K[X_1,...,X_n])^m in a field K is called invertible if there exist g_1,...,g_m in K[X_1,...,x_n] such that ...
An isosceles trapezoid (called an isosceles trapezium by the British; Bronshtein and Semendyayev 1997, p. 174) is trapezoid in which the base angles are equal and therefore ...
A likelihood function L(a) is the probability or probability density for the occurrence of a sample configuration x_1, ..., x_n given that the probability density f(x;a) with ...
For a two-dimensional map with sigma_2>sigma_1, d_(Lya)=1-(sigma_1)/(sigma_2), where sigma_n are the Lyapunov characteristic exponents.
A maximum likelihood estimator is a value of the parameter a such that the likelihood function is a maximum (Harris and Stocket 1998, p. 824).
The set lambda of linear Möbius transformations w which satisfy w(t)=(at+b)/(ct+d), where a and d are odd and b and c are even. lambda is a subgroup of the modular group ...
A multidimensional polylogarithm is a generalization of the usual polylogarithm to L_(a_1,...,a_m)(z)=sum_(n_1>...>n_m>0)(z^(n_1))/(n_1^(a_1)...n_m^(a_m)) with positive ...
1 ... 46|47|48|49|50|51|52 ... 102 Previous Next

...