Search Results for ""

There are two problems commonly known as the subset sum problem. The first ("given sum problem") is the problem of finding what subset of a list of integers has a given sum, ...

A graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...

An Ore graph is a graph that satisfies Ore's theorem, i.e., a graph G for which the sums of the degrees of nonadjacent vertices is greater than or equal to the number of ...

The word basis can arise in several different contexts. Speaking in general terms, an object is "generated" by a basis in whatever manner is appropriate. For example, a ...

A d-hyperoctant is one of the 2^d regions of space defined by the 2^d possible combinations of signs (+/-,+/-,...,+/-). The 2-hyperoctant is known as a quadrant and the ...

A robust estimation based on linear combinations of order statistics. Examples include the statistical median and the trimean.

One of the four regions of the plane defined by the four possible combinations of signs (+,+), (+,-), (-,+), and (-,-) for (x,y).

A related rates problem is the determination of the rate at which a function defined in terms of other functions changes. Related rates problems can be solved by computing ...

An estimation technique which is insensitive to small departures from the idealized assumptions which have been used to optimize the algorithm. Classes of such techniques ...

An ordering of permutations in which each two adjacent permutations differ by the transposition of two elements. For the permutations of {1,2,3} there are two listings which ...