TOPICS
Search

Search Results for ""


1611 - 1620 of 1759 for Simple Random WalkSearch Results
The Kakeya needle problems asks for the plane figure of least area in which a line segment of width 1 can be freely rotated (where translation of the segment is also ...
The Knuth-Bendix completion algorithm attempts to transform a finite set of identities into a finitely terminating, confluent term rewriting system whose reductions preserve ...
The Lerch transcendent is generalization of the Hurwitz zeta function and polylogarithm function. Many sums of reciprocal powers can be expressed in terms of it. It is ...
The Lovász number theta(G) of a graph G, sometimes also called the theta function of G, was introduced by Lovász (1979) with the explicit goal of estimating the Shannon ...
Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...
The conjugate gradient method can be viewed as a special variant of the Lanczos method for positive definite symmetric systems. The minimal residual method (MINRES) and ...
The term multigraph refers to a graph in which multiple edges between nodes are either permitted (Harary 1994, p. 10; Gross and Yellen 1999, p. 4) or required (Skiena 1990, ...
An NSW number (named after Newman, Shanks, and Williams) is an integer m that solves the Diophantine equation 2n^2=m^2+1. (1) In other words, the NSW numbers m index the ...
A normalized form of the cumulative normal distribution function giving the probability that a variate assumes a value in the range [0,x], ...
The lines containing the three points of the intersection of the three pairs of opposite sides of a (not necessarily regular) hexagon. There are 6! (i.e., 6 factorial) ...
1 ... 159|160|161|162|163|164|165 ... 176 Previous Next

...