Cooley john w (26 Ergebnisse)

Paperback. Zustand: Good.

Zustand: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc.

Zustand: Good. Good condition. A copy that has been read but remains intact. May contain markings such as bookplates, stamps, limited notes and highlighting, or a few light stains.

Zustand: As New. Like New condition. A near perfect copy that may have very minor cosmetic defects.

Hardcover. Zustand: Very Good. No Jacket. Former library book; May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Zustand: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Paperback. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Paperback. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Paperback. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

Paperback. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

gebundene Ausgabe. Zustand: Gut. 1st Edition.. 280 Seiten; Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Instituts-Stempel.); leichte altersbedingte Anbräunung des Papiers; der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. Einbandkanten sind leicht bestoßen. In ENGLISCHER Sprache. Buchschnitt leicht stockfleckig. Sprache: Englisch Gewicht in Gramm: 680.…

Zustand: New. In English.

Zustand: Good.

Trade paperback. 370 p. Very good. No dust jacket as issued. Signed by author. Cover has minor wear and soiling.

Zustand: New. In English.

Zustand: New. In English.

Paperback. Zustand: Fair. 2. The item might be beaten up but readable. May contain markings or highlighting, as well as stains, bent corners, or any other major defect, but the text is not obscured in any way.

Buch. Zustand: Neu. Neuware.

Gebunden. Zustand: New.

Gebunden. Zustand: New.

Buch. Zustand: Neu. Neuware.

Paperback/ broschiert. Zustand: Gut. 250 S. Humanwissenschaft menschliche Talente kognitive Fähigkeiten Intelligenzforschung Stamped edges. Guter Zustand/ Good Ex-Library. With tables. ha1063709 Sprache: Englisch Gewicht in Gramm: 830.

Zustand: New. Various Pagings.

Zustand: New.

Paperback. Zustand: Brand New. 2nd new edition. 470 pages. 9.84x7.05x0.98 inches. In Stock.

Contained in Mathematics of Computation, Vol. 19, No. 90, pp. 297-301. 8vo. pp. 177-364. Original printed wrappers bound in. Black cloth, printed paper spine label. Institutional exlib stamp on printed wrapper cover, ownership marks on printed covers. Fine. FIRST EDITION. This important work on the fast Fourier transform (FFT) algorithm, which is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse. FFTs are of great importance to a wide variety of applications, from digital signal processing and solving partial differential equations to algorithms for quick multiplication of large integers. "By far the most common FFT is the Cooley-Tukey algorithm. This is a divide and conquer algorithm that recursively breaks down a DFT of any composite size N = N1N2 into many smaller DFTs of sizes N1 and N2, along with O(N) multiplications by complex roots of unity, traditionally called twiddle factors (after Gentleman and Sande, 1966). This method (and the general idea of an FFT) was popularized by a publication of J. W. Cooley and J. W. Tukey in 1965, but it was later discovered that those two authors had independently re-invented an algorithm known to Carl Friedrich Gauss around 1805 (and subsequently rediscovered several times in limited forms). The most well-known use of the Cooley-Tukey algorithm is to divide the transform into two pieces of size N / 2 at each step, and is therefore limited to power-of-two sizes, but any factorization can be used in general (as was known to both Gauss and Cooley/Tukey). These are called the radix-2 and mixed-radix cases, respectively (and other variants such as the split-radix FFT have their own names as well). Although the basic idea is recursive, most traditional implementations rearrange the algorithm to avoid explicit recursion. Also, because the Cooley-Tukey algorithm breaks the DFT into smaller DFTs, it can be combined arbitrarily with any other algorithm for the DFT." [Wikip.]. Norman, Origins of Cyberspace 548.…