Search Results for ""

The triangle center with triangle center function alpha=A.

For P, Q, R, and S polynomials in n variables [P·Q,R·S]=sum_(i_1,...,i_n>=0)A/(i_1!...i_n!), (1) where A=[R^((i_1,...,i_n))(D_1,...,D_n)Q(x_1,...,x_n) ...

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

For a measurable function mu, the Beltrami differential equation is given by f_(z^_)=muf_z, where f_z is a partial derivative and z^_ denotes the complex conjugate of z.

The orthogonal polynomials on the interval [-1,1] associated with the weighting functions w(x) = (1-x^2)^(-1/2) (1) w(x) = (1-x^2)^(1/2) (2) w(x) = sqrt((1-x)/(1+x)), (3) ...

If g(theta) is a trigonometric polynomial of degree m satisfying the condition |g(theta)|<=1 where theta is arbitrary and real, then g^'(theta)<=m.

Let x^__1 and s_1^2 be the observed mean and variance of a sample of N_1 drawn from a normal universe with unknown mean mu_((1)) and let x^__2 and s_2^2 be the observed mean ...

Another "beta function" defined in terms of an integral is the "exponential" beta function, given by beta_n(z) = int_(-1)^1t^ne^(-zt)dt (1) = ...

A distribution with probability function P(x)=(x^(alpha-1)(1+x)^(-alpha-beta))/(B(alpha,beta)), where B is a beta function. The mode of a variate distributed as ...

A maximal subgraph of an undirected graph such that any two edges in the subgraph lie on a common simple cycle.