Search Results for ""
201 - 210 of 525 for Maximum LikelihoodSearch Results
The fractional edge chromatic number of a graph G is the fractional analog of the edge chromatic number, denoted chi_f^'(G) by Scheinerman and Ullman (2011). It can be ...
The hyperbolic secant is defined as sechz = 1/(coshz) (1) = 2/(e^z+e^(-z)), (2) where coshz is the hyperbolic cosine. It is implemented in the Wolfram Language as Sech[z]. On ...
In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...
For a given positive integer n, does there exist a weighted tree with n graph vertices whose paths have weights 1, 2, ..., (n; 2), where (n; 2) is a binomial coefficient? ...
Togliatti (1940, 1949) showed that quintic surfaces having 31 ordinary double points exist, although he did not explicitly derive equations for such surfaces. Beauville ...
The expectation value of a function f(x) in a variable x is denoted <f(x)> or E{f(x)}. For a single discrete variable, it is defined by <f(x)>=sum_(x)f(x)P(x), (1) where P(x) ...
The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...
The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...
The set of roots of a polynomial f(x,y,z)=0. An algebraic surface is said to be of degree n=max(i+j+k), where n is the maximum sum of powers of all terms ...
Betti numbers are topological objects which were proved to be invariants by Poincaré, and used by him to extend the polyhedral formula to higher dimensional spaces. ...
...
View search results from all Wolfram sites (5249 matches)

