TOPICS
Search

Search Results for ""


6081 - 6090 of 13135 for Computational GeometrySearch Results
Little-omega notation is the inverse of the Landau symbol o, i.e., f(n) in o(phi(n)) <==> phi(n) in omega(f(n)).
A roll of 4 on a pair of six-sided dice in the game of craps (Gardner 1978, p. 256). The probability of rolling "a little Joe" is 1/12, or 8.333...%. A roll of "4 the hard ...
The name Lobachevsky's function is sometimes given to the function Lambda(theta)=1/2Cl_2(2theta), also denoted Pi(theta), where Cl_2(x) is Clausen's integral.
Let X be a topological vector space and for an arbitrary point x in X, denote by N_(x) the collection of all neighborhoods of x in X. A local base at x is any set B subset ...
The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...
The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...
A local extremum, also called a relative extremum, is a local minimum or local maximum.
The study of a finite group G using the local subgroups of G. Local group theory plays a critical role in the classification theorem of finite groups.
A local maximum, also called a relative maximum, is a maximum within some neighborhood that need not be (but may be) a global maximum.
A local minimum, also called a relative minimum, is a minimum within some neighborhood that need not be (but may be) a global minimum.
1 ... 606|607|608|609|610|611|612 ... 1314 Previous Next

...