Search Results for ""
1761 - 1770 of 3016 for Continuous Mapping TheoremSearch Results
A real-valued univariate function f=f(x) has a jump discontinuity at a point x_0 in its domain provided that lim_(x->x_0-)f(x)=L_1<infty (1) and lim_(x->x_0+)f(x)=L_2<infty ...
An algorithm for partitioning (or clustering) N data points into K disjoint subsets S_j containing N_j data points so as to minimize the sum-of-squares criterion ...
In practice, the vertical offsets from a line (polynomial, surface, hyperplane, etc.) are almost always minimized instead of the perpendicular offsets. This provides a ...
The n functions f_1(x), f_2(x), ..., f_n(x) are linearly dependent if, for some c_1, c_2, ..., c_n in R not all zero, sum_(i=1)^nc_if_i(x)=0 (1) for all x in some interval I. ...
The symbol o(x), pronounced "little-O of x," is one of the Landau symbols and is used to symbolically express the asymptotic behavior of a given function. In particular, if n ...
The set of L^p-functions (where p>=1) generalizes L2-space. Instead of square integrable, the measurable function f must be p-integrable for f to be in L^p. On a measure ...
A function f:X->R is measurable if, for every real number a, the set {x in X:f(x)>a} is measurable. When X=R with Lebesgue measure, or more generally any Borel measure, then ...
A variable x is memoryless with respect to t if, for all s with t!=0, P(x>s+t|x>t)=P(x>s). (1) Equivalently, (P(x>s+t,x>t))/(P(x>t)) = P(x>s) (2) P(x>s+t) = P(x>s)P(x>t). (3) ...
A multivalued function, also known as a multiple-valued function (Knopp 1996, part 1 p. 103), is a "function" that assumes two or more distinct values in its range for at ...
Beautiful patterns can be created by drawing sets of nested polygons such that the incircle of the nth polygon is the circumcircle of the (n+1)st and successive polygons are ...
...
View search results from all Wolfram sites (13889 matches)

