Search Results for ""
611 - 620 of 863 for Von Mises distributionSearch Results
Rosser's rule states that every Gram block contains the expected number of roots, which appears to be true for computable Gram blocks. Rosser et al. (1969) expressed a belief ...
A sample is a subset of a population that is obtained through some process, possibly random selection or selection based on a certain set of criteria, for the purposes of ...
The sample mean of a set {x_1,...,x_n} of n observations from a given distribution is defined by m=1/nsum_(k=1)^nx_k. It is an unbiased estimator for the population mean mu. ...
When computing the sample variance s numerically, the mean must be computed before s^2 can be determined. This requires storing the set of sample values. However, it is ...
A scale-free network is a connected graph or network with the property that the number of links k originating from a given node exhibits a power law distribution ...
The Schur decomposition of a complex square matrix A is a matrix decomposition of the form Q^(H)AQ=T=D+N, (1) where Q is a unitary matrix, Q^(H) is its conjugate transpose, ...
The average number of regions N(n) into which n lines divide a square is N^_(n)=1/(16)n(n-1)pi+n+1 (Santaló 1976; Finch 2003, p. 481). The maximum number of sequences is ...
The square knot, also called the reef knot, is a composite knot of six crossings consisting of a knot sum of a trefoil knot and its mirror image (Rolfsen 1976, p. 220). The ...
The number of staircase walks on a grid with m horizontal lines and n vertical lines is given by (m+n; m)=((m+n)!)/(m!n!) (Vilenkin 1971, Mohanty 1979, Narayana 1979, Finch ...
(1) for p in [-1/2,1/2], where delta is the central difference and S_(2n+1) = 1/2(p+n; 2n+1) (2) S_(2n+2) = p/(2n+2)(p+n; 2n+1), (3) with (n; k) a binomial coefficient.
...
View search results from all Wolfram sites (8972 matches)

