TOPICS
Search

Search Results for ""


191 - 200 of 359 for Reduced Error PruningSearch Results
For a single variate X having a distribution P(x) with known population mean mu, the population variance var(X), commonly also written sigma^2, is defined as ...
The asymptotic form of the n-step Bernoulli distribution with parameters p and q=1-p is given by P_n(k) = (n; k)p^kq^(n-k) (1) ∼ 1/(sqrt(2pinpq))e^(-(k-np)^2/(2npq)) (2) ...
11 21 3 41 4 7 81 5 11 15 161 6 16 26 31 32 (1) The number triangle illustrated above (OEIS A008949) composed of the partial sums of binomial coefficients, a_(nk) = ...
A Gaussian quadrature-like formula for numerical estimation of integrals. It uses weighting function W(x)=1 in the interval [-1,1] and forces all the weights to be equal. The ...
A code is a set of n-tuples of elements ("words") taken from an alphabet. The designation "code n" is also given to the nth totalistic cellular automaton in Wolfram's ...
Given a linear code C, a generator matrix G of C is a matrix whose rows generate all the elements of C, i.e., if G=(g_1 g_2 ... g_k)^(T), then every codeword w of C can be ...
Hermite-Gauss quadrature, also called Hermite quadrature, is a Gaussian quadrature over the interval (-infty,infty) with weighting function W(x)=e^(-x^2) (Abramowitz and ...
The inverse erf function is the inverse function erfc^(-1)(z) of erfc(x) such that erfc(erfc^(-1)(x))=erfc^(-1)(erfc(x)), (1) with the first identity holding for 0<x<2 and ...
Jacobi-Gauss quadrature, also called Jacobi quadrature or Mehler quadrature, is a Gaussian quadrature over the interval [-1,1] with weighting function ...
Nonhomogeneous matrix equations of the form Ax=b (1) can be solved by taking the matrix inverse to obtain x=A^(-1)b. (2) This equation will have a nontrivial solution iff the ...
1 ... 17|18|19|20|21|22|23 ... 36 Previous Next

...