Search Results for ""
321 - 330 of 525 for Maximum LikelihoodSearch Results
The radial curve of the tractrix x = a(t-tanht) (1) y = asecht (2) with radiant point (x_0,y_0) is the kappa curve x_r = x_0+atanht (3) y_r = y_0+asinhttanht. (4)
Let A be a C^*-algebra, then two element a,b of A are called unitarily equivalent if there exists a unitary u in A such that b=uau^*.
A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers ...
n-plex is defined as 10^n.
Let {a_i}_(i=0)^(N-1) be a periodic sequence, then the autocorrelation of the sequence, sometimes called the periodic autocorrelation (Zwillinger 1995, p. 223), is the ...
A box-and-whisker plot (sometimes called simply a box plot) is a histogram-like method of displaying data, invented by J. Tukey. To create a box-and-whisker plot, draw a box ...
A connected graph is said to be highly irregular if the neighbors of each vertex have distinct vertex degrees. Highly irregular graphs exist on all orders except 3, 5 and 7, ...
The concept of irredundance was introduced by Cockayne et al. (1978). Let N_G[v] denote the graph neighborhood of a vertex v in a graph G (including v itself), and let N_G[S] ...
The logistic equation (sometimes called the Verhulst model or logistic growth curve) is a model of population growth first published by Pierre Verhulst (1845, 1847). The ...
Every position of every impartial game has a nim-value, making it equivalent to a nim-heap. To find the nim-value (also called the Sprague-Grundy number), take the mex of the ...
...
View search results from all Wolfram sites (5249 matches)

