<--- Back to Details
First PageDocument Content
Analysis of algorithms / Probabilistic complexity theory / Parallel computing / Reconfigurable computing / Systolic array / Randomized algorithm / Algorithm / Time complexity / Computational geometry / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2012-10-11 21:49:50
Analysis of algorithms
Probabilistic complexity theory
Parallel computing
Reconfigurable computing
Systolic array
Randomized algorithm
Algorithm
Time complexity
Computational geometry
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: www.eecg.toronto.edu

Download Document from Source Website

File Size: 1,44 MB

Share Document on Facebook

Similar Documents

Java Byte Code Synthesis for Reconfigurable Computing Platforms Christophe Dubach Computer Science, master thesis Processor Architecture Laboratory

DocID: 1tNUy - View Document

A Decade of Reconfigurable Computing: a Visionary Retrospective Reiner Hartenstein (embedded tutorial) CS Dept. (Informatik), University of Kaiserslautern, Germany http://www.fpl.uni-kl.de Abstrac

DocID: 1tpFs - View Document

The Proteus Processor — A Conventional CPU with Reconfigurable Functionality Michael Dales Department of Computing Science, University of Glasgow, 17 Lilybank Gardens, Glasgow, G12 8RZ, Scotland.

DocID: 1tlw6 - View Document

Reconfigurable Computing: Paradigmen-Wechsel erschüttern die Fundamente der Informatik Toward Reconfigurable Computing via Concussive Paradigm Shifts Reiner Hartenstein1 (eingeladener Beitrag),

DocID: 1tk7F - View Document

Computing: Reconfigurable versus Rebooting Reiner Hartenstein, IEEE fellow, FPL fellow, RDPS fellow Abstract. There are two different Rebooting Computing communities: one about the attractiveness of computer science educ

DocID: 1tjGX - View Document