TOPICS
Search

Search Results for ""


341 - 350 of 572 for Inline 36Search Results
A fusene is a simple planar 2-connected graph embedded in the plane with all vertices of degree 2 or 3, all bounded faces (not necessarily regular) hexagons, and all vertices ...
A gamma distribution is a general type of statistical distribution that is related to the beta distribution and arises naturally in processes for which the waiting times ...
The Gaussian integral, also called the probability integral and closely related to the erf function, is the integral of the one-dimensional Gaussian function over ...
The first Göllnitz-Gordon identity states that the number of partitions of n in which the minimal difference between parts is at least 2, and at least 4 between even parts, ...
An n-Hadamard graph is a graph on 4n vertices defined in terms of a Hadamard matrix H_n=(h)_(ij) as follows. Define 4n symbols r_i^+, r_i^-, c_i^+, and c_i^-, where r stands ...
The Hamiltonian number h(n) of a connected graph G is the length of a Hamiltonian walk G. In other words, it is the minimum length of a closed spanning walk in the graph. For ...
A sequence {a_n}_(n=1)^N forms a (binary) heap if it satisfies a_(|_j/2_|)<=a_j for 2<=j<=N, where |_x_| is the floor function, which is equivalent to a_i<a_(2i) and ...
A second-order linear Hermitian operator is an operator L^~ that satisfies int_a^bv^_L^~udx=int_a^buL^~v^_dx. (1) where z^_ denotes a complex conjugate. As shown in ...
A hexahedron is a polyhedron with six faces. The figure above shows a number of named hexahedra, in particular the acute golden rhombohedron, cube, cuboid, hemicube, ...
Let there be n ways for a "good" selection and m ways for a "bad" selection out of a total of n+m possibilities. Take N samples and let x_i equal 1 if selection i is ...
1 ... 32|33|34|35|36|37|38 ... 58 Previous Next

...