TOPICS
Search

Search Results for ""


1121 - 1130 of 1376 for algorithmic imageSearch Results
If a complex function is analytic at all finite points of the complex plane C, then it is said to be entire, sometimes also called "integral" (Knopp 1996, p. 112). Any ...
A fan graph F_(m,n) is defined as the graph join K^__m+P_n, where K^__m is the empty graph on m nodes and P_n is the path graph on n nodes. The case m=1 corresponds to the ...
A dissection of a rectangle into smaller rectangles such that the original rectangle is not divided into two subrectangles. Rectangle dissections into 3, 4, or 6 pieces ...
Fisher's exact test is a statistical test used to determine if there are nonrandom associations between two categorical variables. Let there exist two such variables X and Y, ...
Given a system of ordinary differential equations of the form d/(dt)[x; y; v_x; v_y]=-[0 0 -1 0; 0 0 0 -1; Phi_(xx)(t) Phi_(yx)(t) 0 0; Phi_(xy)(t) Phi_(yy)(t) 0 0][x; y; ...
An optical illusion named after British psychologist James Fraser, who first studied the illusion in 1908 (Fraser 1908). The illusion is also known as the false spiral, or by ...
A free idempotent monoid is a monoid that satisfies the identity x^2=x and is generated by a set of elements. If the generating set of such a monoid is finite, then so is the ...
The following are equivalent definitions for a Galois extension field (also simply known as a Galois extension) K of F. 1. K is the splitting field for a collection of ...
Gelfond's theorem, also called the Gelfond-Schneider theorem, states that a^b is transcendental if 1. a is algebraic !=0,1 and 2. b is algebraic and irrational. This provides ...
A generalization of the Fibonacci numbers defined by 1=G_1=G_2=...=G_(c-1) and the recurrence relation G_n=G_(n-1)+G_(n-c). (1) These are the sums of elements on successive ...
1 ... 110|111|112|113|114|115|116 ... 138 Previous Next

...