Search Results for ""

If f:D->Y is a map (a.k.a. function, transformation, etc.) over a domain D, then the image of f, also called the range of D under f, is defined as the set of all values that ...

Algorithmic graph theory is the study of graph traversal and generation and the complexity of these operations. Topics in algorithmic graph theory include Eulerian and ...

An image of an object obtained by reflecting it in a mirror so that the signs of one of its coordinates are reversed.

Let f:A->B be a map between sets A and B. Let Y subset= B. Then the preimage of Y under f is denoted by f^(-1)(Y), and is the set of all elements of A that map to elements in ...

A q-analog of Zeilberger's algorithm.

An algorithm which constructs allowed mathematical statements from simple ingredients.

A fast Fourier transform-like algorithm which produces a hologram of an image.

Turing machines are defined by sets of rules that operate on four parameters: (state, tape cell color, operation, state). Let the states and tape cell colors be numbered and ...

A deconvolution algorithm (sometimes abbreviated MEM) which functions by minimizing a smoothness function ("entropy") in an image. Maximum entropy is also called the ...

A discrete fast Fourier transform algorithm which can be implemented for N=2, 3, 4, 5, 7, 8, 11, 13, and 16 points.