Search Results for ""

The maximum flow between vertices v_i and v_j in a graph G is exactly the weight of the smallest set of edges to disconnect G with v_i and v_j in different components (Ford ...

You buy 100 pounds of potatoes and are told that they are 99% water. After leaving them outside, you discover that they are now 98% water. The weight of the dehydrated ...

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 ...

A nonuniform rational B-spline curve defined by C(t)=(sum_(i=0)^(n)N_(i,p)(t)w_iP_i)/(sum_(i=0)^(n)N_(i,p)(t)w_i), where p is the order, N_(i,p) are the B-spline basis ...

If each of two curves meets the line at infinity in distinct, nonsingular points, and if all their intersections are finite, then if to each common point there is attached a ...

A cusp form is a modular form for which the coefficient c(0)=0 in the Fourier series f(tau)=sum_(n=0)^inftyc(n)e^(2piintau) (1) (Apostol 1997, p. 114). The only entire cusp ...

The weighted mean of a discrete set of numbers {x_1,x_2,...,x_n} with weights {w_1,w_2,...,w_n} is given by <x>=sum_(i=1)^nw_ix_i, (1) where each weight w_i is a nonnegative ...

Let Q_i denote anything subject to weighting by a normalized linear scheme of weights that sum to unity in a set W. The Kolmogorov axioms state that 1. For every Q_i in W, ...

A nonuniform rational B-spline surface of degree (p,q) is defined by ...

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...