Search Results for ""
701 - 710 of 2557 for Set UnionSearch Results
![](/common/images/search/spacer.gif)
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 two-dimensional affine geometry constructed over a finite field. For a field F of size n, the affine plane consists of the set of points which are ordered pairs of elements ...
The problem in computational geometry of identifying the point from a set of points which is nearest to a given point according to some measure of distance. The nearest ...
Parametric equations are a set of equations that express a set of quantities as explicit functions of a number of independent variables, known as "parameters." For example, ...
In a normal n×n Latin square, the entries in each row and column are chosen from a "global" set of n objects. Like a Latin square, a partial Latin square has no two rows or ...
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 ...
A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...
The axiom of Zermelo-Fraenkel set theory which asserts that sets formed by the same elements are equal, forall x(x in a=x in b)=>a=b. Note that some texts (e.g., Devlin ...
A group G is said to act on a set X when there is a map phi:G×X->X such that the following conditions hold for all elements x in X. 1. phi(e,x)=x where e is the identity ...
An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...
![](/common/images/search/spacer.gif)
...