<--- 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

A comparison of the Oligomap and TargetScan algorithms for miRNA target analysis Badreddin Edris BIOC 218 Final Project (Win-09) Stanford University Introduction

DocID: 1vrBA - View Document

M Zuhair Nashed* (). Concepts of Differentiability in Smooth and Non-smooth Analysis with Applications in Optimization Theory and Algorithms. Preliminary report. In this talk I will pro

DocID: 1uZyL - View Document

Experimental Analysis of Receding Horizon Planning Algorithms for Marine Monitoring Soo-Hyun Yoo, Andrew Stuntz, Yawei Zhang, Robert Rothschild, Geoffrey A. Hollinger and Ryan N. Smith Abstract Autonomous surface vehicl

DocID: 1uUAk - View Document

Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 19, no. 1, pp. 375–DOI: jgaaSensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time

DocID: 1uSSm - View Document

Analysis of stochastic technical trading algorithms by Markus Höchstötter, Mher Safarian, Anna Krumetsadik 

DocID: 1uS0N - View Document