Search Results for ""
91 - 100 of 142 for centralizedSearch Results
The upper and lower hinges are descriptive statistics of a set of N data values, where N is of the form N=4n+5 with n=0, 1, 2, .... The hinges are obtained by ordering the ...
An Archimedean spiral with polar equation r=a/theta. (1) The hyperbolic spiral, also called the inverse spiral (Whittaker 1944, p. 83), originated with Pierre Varignon in ...
The Jahangir graph J_(n,m) is a kind of generalized wheel graph with consisting of mn circular vertices and a central vertex connected to every mth vertex around the circle. ...
Suppose x_1<x_2<...<x_n are given positive numbers. Let lambda_1, ..., lambda_n>=0 and sum_(j=1)^(n)lambda_j=1. Then ...
The operator tpartial/partialr that can be used to derive multivariate formulas for moments and cumulants from corresponding univariate formulas. For example, to derive the ...
The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...
Kurtosis is defined as a normalized form of the fourth central moment mu_4 of a distribution. There are several flavors of kurtosis, the most commonly encountered variety of ...
Ball and Coxeter (1987, pp. 277-278) define the ladder graph nP_2, here called the ladder rung graph, of order n as the graph union of n copies of the path graph P_2. The ...
The Lambert azimuthal equal-area projection is a map projection having transformation equations x = k^'cosphisin(lambda-lambda_0) (1) y = ...
A sufficient condition on the Lindeberg-Feller central limit theorem. Given random variates X_1, X_2, ..., let <X_i>=0, the variance sigma_i^2 of X_i be finite, and variance ...
...
View search results from all Wolfram sites (800 matches)

