TOPICS
Search

Search Results for ""


1521 - 1530 of 2058 for Sierpinski Sieve GraphSearch Results
Given a set S of points in the plane, an enclosing circle is a circle for which all points S lie in its interior.
An error-correcting code is an algorithm for expressing a sequence of numbers such that any errors which are introduced can be detected and corrected (within certain ...
The bias of an estimator theta^~ is defined as B(theta^~)=<theta^~>-theta. (1) It is therefore true that theta^~-theta = (theta^~-<theta^~>)+(<theta^~>-theta) (2) = ...
For any two integers a and b, suppose d|ab. Then if d is relatively prime to a, then d divides b. This results appeared in Euclid's Elements, Book VII, Proposition 30. This ...
The solution to a game in game theory. When a game saddle point is present max_(i<=m)min_(j<=n)a_(ij)=min_(j<=n)max_(i<=m)a_(ij)=v, and v is the value for pure strategies.
A non-Euclidean space with constant negative Gaussian curvature.
When a point P moves along a line through the circumcenter of a given triangle Delta, the pedal circle of P with respect to Delta passes through a fixed point (the Griffiths ...
The convolution of two complex-valued functions on a group G is defined as (a*b)(g)=sum_(k in G)a(k)b(k^(-1)g) where the support (set which is not zero) of each function is ...
A n-gonal cupola adjoined to a 2n-gonal antiprism.
A binary Hamming code H_r of length n=2^r-1 (with r>=2) is a linear code with parity-check matrix H whose columns consist of all nonzero binary vectors of length r, each used ...
1 ... 150|151|152|153|154|155|156 ... 206 Previous Next

...