TOPICS
Search

Search Results for ""


791 - 800 of 1245 for image processingSearch Results
Let L denote the partition lattice of the set {1,2,...,n}. The maximum element of L is M={{1,2,...,n}} (1) and the minimum element is m={{1},{2},...,{n}}. (2) Let Z_n denote ...
A level set in two dimensions. Phase curves are sometimes also known as level curves (Tabor 1989, p. 14).
A fractal curve, also called the C-curve (Gosper 1972). The base curve and motif are illustrated below. Duvall and Keesling (1999) proved that the Hausdorff dimension of the ...
The lower central series of a Lie algebra g is the sequence of subalgebras recursively defined by g_(k+1)=[g,g_k], (1) with g_0=g. The sequence of subspaces is always ...
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. ...
A linklessly embeddable graph is a graph having the property that there exists an embedding in three dimensions that does not contain a nontrivial link. A graph is linklessly ...
The term "lobster" is used to refer either to a particular polyiamond or to a class of tree called a lobster graph. When referring to polyiamonds, the lobster is the ...
Let P be a class of (universal) algebras. Then an algebra A is a local P-algebra provided that every finitely generated subalgebra F of A is a member of the class P. Note ...
A lattice L is locally subbounded if and only if each of its finite subsets is contained in a finitely generated bounded sublattice of L. Every locally bounded lattice is ...
The logarithmic capacity of a compact set E in the complex plane is given by gamma(E)=e^(-V(E)), (1) where V(E)=inf_(nu)int_(E×E)ln1/(|u-v|)dnu(u)dnu(v), (2) and nu runs over ...
1 ... 77|78|79|80|81|82|83 ... 125 Previous Next

...