TOPICS
Search

Search Results for ""


901 - 910 of 13135 for triangle geometrySearch Results
The ending of a game in which neither of two players wins, sometimes also called a "tie." A game in which no draw is possible is called a categorical game.
Given a contravariant basis {e^->_1,...,e^->_n}, its dual covariant basis is given by e^->^alpha·e^->_beta=g(e^->^alpha,e^->_beta)=delta_beta^alpha, where g is the metric and ...
A knot K is an n-embeddable knot if it can be placed on a genus n standard embedded surface without crossings, but K cannot be placed on any standardly embedded surface of ...
A ring without zero divisors in which an integer norm and an associated division algorithm (i.e., a Euclidean algorithm) can be defined. For signed integers, the usual norm ...
Also known as the difference of squares method. It was first used by Fermat and improved by Gauss. Gauss looked for integers x and y satisfying y^2=x^2-N (mod E) for various ...
A function whose value increases more quickly than any polynomial is said to be an exponentially increasing function. The prototypical example is the function e^x, plotted ...
Given T an unbiased estimator of theta so that <T>=theta. Then var(T)>=1/(Nint_(-infty)^infty[(partial(lnf))/(partialtheta)]^2fdx), where var is the variance.
Consider a square wave f(x) of length 2L. Over the range [0,2L], this can be written as f(x)=2[H(x/L)-H(x/L-1)]-1, (1) where H(x) is the Heaviside step function. Since ...
By analogy with the geometric centroid, the centroid of an arbitrary function f(x) is defined as <x>=(intxf(x)dx)/(intf(x)dx), (1) where the integrals are taken over the ...
Assignment of each graph edge of a graph to one of two color classes (commonly designation "red" and "green").
1 ... 88|89|90|91|92|93|94 ... 1314 Previous Next

...