Search Results for ""
241 - 250 of 354 for Direction, Location, NavigationSearch Results

Levenberg-Marquardt is a popular alternative to the Gauss-Newton method of finding the minimum of a function F(x) that is a sum of squares of nonlinear functions, ...
A minimal surface that contains lemniscates as geodesics which is given by the parametric equations x = R[sqrt(2)cos(1/3zeta)sqrt(cos(2/3zeta))] (1) y = ...
A semi-Riemannian manifold M=(M,g) is said to be Lorentzian if dim(M)>=2 and if the index I=I_g associated with the metric tensor g satisfies I=1. Alternatively, a smooth ...
The problem of finding the strategy to guarantee reaching the boundary of a given region ("forest") in the shortest distance (i.e., a strategy having the best worst-case ...
A path, also known as a rhumb line, which cuts a meridian on a given surface at any constant angle but a right angle. If the surface is a sphere, the loxodrome is a spherical ...
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 ...
Let x=(x_1,x_2,...,x_n) and y=(y_1,y_2,...,y_n) be nonincreasing sequences of real numbers. Then x majorizes y if, for each k=1, 2, ..., n, sum_(i=1)^kx_i>=sum_(i=1)^ky_i, ...
A sequence of random variates X_0, X_1, ... with finite means such that the conditional expectation of X_(n+1) given X_0, X_1, X_2, ..., X_n is equal to X_n, i.e., ...
A maximally nonhamiltonian graph is a nonhamiltonian graph G for which G+e is Hamiltonian for each edge e in the graph complement of G^_, i.e., every two nonadjacent vertices ...
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. ...

...