<--- Back to Details
First PageDocument Content
Computer architecture / Parallel computing / Cell / MapReduce / Merge sort / Quicksort / Stack / Extract /  transform /  load / Data Intensive Computing / Computing / Sorting algorithms / Order theory
Date: 2007-11-08 15:56:59
Computer architecture
Parallel computing
Cell
MapReduce
Merge sort
Quicksort
Stack
Extract
transform
load
Data Intensive Computing
Computing
Sorting algorithms
Order theory

Add to Reading List

Source URL: pages.cs.wisc.edu

Download Document from Source Website

File Size: 528,02 KB

Share Document on Facebook

Similar Documents

Frobenius Additive Fast Fourier Transform Wen-Ding Li Ming-Shing Chen Po-Chun Kuo

DocID: 1xVYf - View Document

Blockchains / Cryptocurrencies / Computing / Concurrent computing / Ethereum / Distributed computing / R3 / Cross-platform software / CORDA / Sam Lee / Hyperledger

Delivering blockchain technology to transform the way the world does business Our vision is of a world where everyone can transact directly and privately without friction; a world where business partners operate in perfe

DocID: 1xVJf - View Document

Management accounting / Accounting software / Asset management / Business process management / Investment management

Multifonds Global Accounting Transform your fund administration activity with sophisticated workflow and production control techniques. Drive dramatic increases in operational efficiency via advanced global operating mod

DocID: 1xVbo - View Document

For New Year’s Eve, nhow Berlin will transform into Studio 54! Indulge in Champagne and a big New Year’s Eve buffet with live cooking. Dance the night away on our two party floors with live band and DJs.

DocID: 1xUx0 - View Document

Mathematics / Mathematical analysis / Algebra / Fourier analysis / Polynomials / Unitary operators / Multiplication / Discrete Fourier transform / Numerical analysis / Polynomial / Fourier transform / Root of unity

Polynomials and the Fast Fourier Transform (FFT)

DocID: 1xUw0 - View Document