Theory of Computation I

Compare

Overview The objective of the course is to provide an exposition first to the notion of computability, then to the notion of computational feasibility or tractability

High Performance Computing

Compare

Overview The objective of this course is to learn how to improve the quality of the programs that you write for execution on high performance computer systems.

Compiler Design

Compare

Lecture Details Compiler Design by Prof.Y.N.Srikant,Department of Computer Science and Automation,IISC Bangalore. For more details on NPTEL visit httpnptel.iitm.ac.in

Computer Algorithms

Compare

Overview Contents: Graph_Basics - Breadth_First_Search - Dijkstra_Algo - All Pair Shortest Path - Matriods - Minimum Spanning Tree - Edmond's Matching Algo - Flow Networks - Ford Fulkerson Method

High Performance Computer Architecture

Compare

Overview Review of Basic Organization and Architectural Techniques: RISC processors,Characteristics of RISC processors,RISC Vs CISC,Classification of Instruction Set Architectures,Review of performance measurements,Basic parallel processing techniques: instruction level, thread level and process level,Classification of parallel architectures.

Performance Evaluation of Computer Systems

Compare

Overview Contents: Introduction - How to avoid common mistakes - Selection of techniques and metrics - Case study: Selection of techniques and metrics - Random Variables and probability distributions - Probability distributions

Numerical Optimization

Compare

Overview Contents: Introduction : Optimization, Types of Problems and Algorithms Background : Linear Algebra and Analysis,Convex Sets and Convex Functions.

Natural Language Processing

Compare

Overview Contents: Sound : Biology of Speech Processing; Place and Manner of Articulation; Word Boundary Detection; Argmax based computations; HMM and Speech Recognition.

Computational Geometry

Compare

Overview Contents: Introduction using basic visibility problems : Introduction,Visibility problems 2D Maxima - The plane sweep technique and applications - The plane sweep technique and application - Convex hull different paradigms and quickhull - Dual transformation and applications - Lower bounds on algebraic tree model - Point location and triangulation - Voronoi diagram and delaunay triangulation - Randomized incremental construction and random sampling - Arrangements and levels - Range searching - Clustering point sets using quadtrees and applications - E-nets VC dimension and applications - Shape analysis and shape comparison