Search Results for ""
211 - 220 of 13135 for Computational GeometrySearch Results
Let P=a_1x+a_2x^2+... be an almost unit in the integral domain of formal power series (with a_1!=0) and define P^k=sum_(n=k)^inftya_n^((k))x^n (1) for k=+/-1, +/-2, .... If ...
For p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, (1) polynomial of degree n>=1, the Schur transform is defined by the (n-1)-degree polynomial Tp(z) = a^__0p(z)-a_np^*(z) (2) = ...
Wilker's inequalities state that 2+(16)/(pi^4)x^3tanx<(sin^2x)/(x^2)+(tanx)/x<2+2/(45)x^3tanx for 0<x<pi/2, where the constants 2/45 and 16/pi^4 are the best possible ...
A reduction system is called confluent (or globally confluent) if, for all x, u, and w such that x->_*u and x->_*w, there exists a z such that u->_*z and w->_*z. A reduction ...
A tag system in which a list of n tag rules (each of a special form) is applied to a system in sequential order and then starting again from the first rule. In a cyclic tag ...
A sequential substitution system is a substitution system in which a string is scanned from left to right for the first occurrence of the first rule pattern. If the pattern ...
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 ...
The shortest circular sequence of length sigma^n such that every string of length n on the alphabet a of size sigma occurs as a contiguous subrange of the sequence described ...
In hexagonal close packing, layers of spheres are packed so that spheres in alternating layers overlie one another. As in cubic close packing, each sphere is surrounded by 12 ...
Given a simplex of unit content in Euclidean d-space, pick n>=d+1 points uniformly and independently at random, and denote the expected content of their convex hull by ...
...