Search Results for ""
1511 - 1520 of 2674 for Distance Between PointsSearch Results
In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), a signaling NaN or sNaN is a NaN which is signaling in the sense of being most commonly returned in ...
A simple point process (or SPP) is an almost surely increasing sequence of strictly positive, possibly infinite random variables which are strictly increasing as long as they ...
A pathwise-connected domain is said to be simply connected (also called 1-connected) if any simple closed curve can be shrunk to a point continuously in the set. If the ...
Given an ordinary differential equation y^'=f(x,y), the slope field for that differential equation is the vector field that takes a point (x,y) to a unit vector with slope ...
Dissect a triangle into smaller triangles, such that all have full edge contact with their neighbors. Label the corners 1, 2, and 3. Label all vertices with 1, 2, or 3, with ...
One of the three classes of tori illustrated above and given by the parametric equations x = (c+acosv)cosu (1) y = (c+acosv)sinu (2) z = asinv. (3) The three different ...
The geometric centroid of the system obtained by placing a mass equal to the magnitude of the exterior angle at each vertex (Honsberger 1995, p. 120) is called the Steiner ...
Stochastic is synonymous with "random." The word is of Greek origin and means "pertaining to chance" (Parzen 1962, p. 7). It is used to indicate that a particular subject is ...
A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...
If f:M->N, then the tangent map Tf associated to f is a vector bundle homeomorphism Tf:TM->TN (i.e., a map between the tangent bundles of M and N respectively). The tangent ...
...
View search results from all Wolfram sites (30690 matches)

