Search Results for ""

Any set of n+2 points in R^n can always be partitioned in two subsets V_1 and V_2 such that the convex hulls of V_1 and V_2 intersect.

The modification of a set of data to make it smooth and nearly continuous and remove or diminish outlying points.

A spatial point process is a point process which models data that is localized at a discrete set of locations in space or, more specifically, on a plane.

A permutation which shifts all elements of a set by a fixed offset, with the elements shifted off the end inserted back at the beginning. For a set with elements a_0, a_1, ...

The digraph intersection of two digraphs is the digraph whose vertex set (respectively, edge set) is the intersection of their vertex sets (respectively, edge sets). If n is ...

Let {y^k} be a set of orthonormal vectors with k=1, 2, ..., K, such that the inner product (y^k,y^k)=1. Then set x=sum_(k=1)^Ku_ky^k (1) so that for any square matrix A for ...

Suppose W is the set of all complex-valued functions f on the interval [0,2pi] of the form f(t)=sum_(k=-infty)^inftyalpha_ke^(ikt) (1) for t in [0,2pi], where the alpha_k in ...

A perfect ruler also called a complete ruler, is type of ruler considered by Guy (1994) which has k distinct marks spaced such that the distances between marks can be used to ...

A convex polyhedron can be defined algebraically as the set of solutions to a system of linear inequalities mx<=b, where m is a real s×3 matrix and b is a real s-vector. ...

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