TOPICS
Search

Search Results for ""


8841 - 8850 of 13135 for Sigma AlgebraSearch Results
Nonparametric estimation is a statistical method that allows the functional form of a fit to data to be obtained in the absence of any guidance or constraints from theory. As ...
The Nørlund polynomial (note that the spelling Nörlund also appears in various publications) is a name given by Carlitz (1960) and Adelberg (1997) to the polynomial ...
Let u_(p) be a unit tangent vector of a regular surface M subset R^3. Then the normal curvature of M in the direction u_(p) is kappa(u_(p))=S(u_(p))·u_(p), (1) where S is the ...
According to many authors (e.g., Kelley 1955, p. 112; Joshi 1983, p. 162; Willard 1970, p. 99) a normal space is a topological space in which for any two disjoint closed sets ...
Perhaps the most commonly-studied oriented point lattice is the so-called north-east lattice which orients each edge of L in the direction of increasing coordinate-value. ...
The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)). It is distance-regular as well as ...
A notation is a set of well-defined rules for representing quantities and operations with symbols.
A set X is said to be nowhere dense if the interior of the set closure of X is the empty set. For example, the Cantor set is nowhere dense. There exist nowhere dense sets of ...
nu(x) = int_0^infty(x^tdt)/(Gamma(t+1)) (1) nu(x,alpha) = int_0^infty(x^(alpha+t)dt)/(Gamma(alpha+t+1)), (2) where Gamma(z) is the gamma function (Erdélyi et al. 1981, p. ...
The term "null graph" is used both to refer to any empty graph and to the empty graph on 0 nodes. Because of the conflicting usage, it is probably best to avoid use of the ...
1 ... 882|883|884|885|886|887|888 ... 1314 Previous Next

...