discrete mapping

  • 111European History Network — The European History Network has run a number of projects under the banner CLIOH ( Creating Links and Overviews for a New History Agenda ) since 1988, including CLIOH, CLIOHnet and CLIOHnet2. CLIOHRES and CLIOH WORLD are currently in operation.… …

    Wikipedia

  • 112Generating function — This article is about generating functions in mathematics. For generating functions in classical mechanics, see Generating function (physics). For signalling molecule, see Epidermal growth factor. In mathematics, a generating function is a formal …

    Wikipedia

  • 113Von Neumann algebra — In mathematics, a von Neumann algebra or W* algebra is a * algebra of bounded operators on a Hilbert space that is closed in the weak operator topology and contains the identity operator. They were originally introduced by John von Neumann,… …

    Wikipedia

  • 114Least-squares spectral analysis — (LSSA) is a method of estimating a frequency spectrum, based on a least squares fit of sinusoids to data samples, similar to Fourier analysis. [cite book | title = Variable Stars As Essential Astrophysical Tools | author = Cafer Ibanoglu |… …

    Wikipedia

  • 115Nobel Prizes — ▪ 2009 Introduction Prize for Peace       The 2008 Nobel Prize for Peace was awarded to Martti Ahtisaari, former president (1994–2000) of Finland, for his work over more than 30 years in settling international disputes, many involving ethnic,… …

    Universalium

  • 116Davenport–Schinzel sequence — In combinatorics, a Davenport–Schinzel sequence is a sequence of symbols in which the number of times any two symbols may appear in alternation is limited. The maximum possible length of a Davenport–Schinzel sequence is bounded by the number of… …

    Wikipedia

  • 117Prime-factor FFT algorithm — The Prime factor algorithm (PFA), also called the Good Thomas algorithm (1958/1963), is a fast Fourier transform (FFT) algorithm that re expresses the discrete Fourier transform (DFT) of a size N = N 1 N 2 as a two dimensional N 1 times; N 2 DFT …

    Wikipedia

  • 118Jordan normal form — In linear algebra, a Jordan normal form (often called Jordan canonical form)[1] of a linear operator on a finite dimensional vector space is an upper triangular matrix of a particular form called Jordan matrix, representing the operator on some… …

    Wikipedia

  • 119Braid group — In mathematics, the braid group on n strands, denoted by B n , is a certain group which has an intuitive geometrical representation, and in a sense generalizes the symmetric group S n . Here, n is a natural number; if n gt; 1, then B n is an… …

    Wikipedia

  • 120GPGPU — General purpose computing on graphics processing units (GPGPU, also referred to as GPGP and to a lesser extent GP²) is the technique of using a GPU, which typically handles computation only for computer graphics, to perform computation in… …

    Wikipedia