5 Classes (60 Units)

6.438 (12), 6.814 (12), 6.829 (12), 6.852 (12), 18.404 (12)

Pre-Register


6.438 Algorithms for Inference

Class Info

Introduction to statistical inference with probabilistic graphical models. Directed and undirected graphical models, and factor graphs, over discrete and Gaussian distributions; hidden Markov models, linear dynamical systems. Sum-product and junction tree algorithms; forward-backward algorithm, Kalman filtering and smoothing. Min-sum and Viterbi algorithms. Variational methods, mean-field theory, and loopy belief propagation. Particle methods and filtering. Building graphical models from data, including parameter estimation and structure learning; Baum-Welch and Chow-Liu algorithms. Selected special topics.

This class has 6.008, 6.041B, 6.436, and 18.06 as prerequisites.

6.438 will be offered this semester (Fall 2017). It is instructed by G. Bresler.

Lecture occurs 9:30 AM to 11:00 AM on Tuesdays and Thursdays in 4-370.

This class counts for a total of 12 credits.

You can find more information at the http://www.google.com/search?&q=MIT+%2B+6.438&btnG=Google+Search&inurl=https site or on the 6.438 Stellar site.

MIT 6.438 Algorithms for Inference Related Textbooks

6.814 Database Systems

Class Info

Topics related to the engineering and design of database systems, including data models; database and schema design; schema normalization and integrity constraints; query processing; query optimization and cost estimation; transactions; recovery; concurrency control; isolation and consistency; distributed, parallel and heterogeneous databases; adaptive databases; trigger systems; pub-sub systems; semi structured data and XML querying. Lecture and readings from original research papers. Semester-long project and paper. Students taking graduate version complete different assignments. Enrollment may be limited.

This class has 6.033, 6.046, and 6.006 as prerequisites.

6.814 will be offered this semester (Fall 2017). It is instructed by S. R. Madden.

Lecture occurs 2:30 PM to 4:00 PM on Mondays and Wednesdays in 32-155.

This class counts for a total of 12 credits.

You can find more information at the 6.830/6.814: Database Systems site.

MIT 6.814 Database Systems Related Textbooks
MIT 6.814 Database Systems On The Web

6.829 Computer Networks

Class Info

Topics on the engineering and analysis of network protocols and architecture, including architectural principles for designing heterogeneous networks; transport protocols; Internet routing; router design; congestion control and network resource management; wireless networks; network security; naming; overlay and peer-to-peer networks. Readings from original research papers. Semester-long project and paper.

This class has 6.033 as a prerequisite.

6.829 will be offered this semester (Fall 2017). It is instructed by D. Katabi.

Lecture occurs 1:00 PM to 2:30 PM on Tuesdays and Thursdays in 32-144.

This class counts for a total of 12 credits.

You can find more information at the http://www.google.com/search?&q=MIT+%2B+6.829&btnG=Google+Search&inurl=https site.

MIT 6.829 Computer Networks Related Textbooks

6.852 Distributed Algorithms

Class Info

Design and analysis of concurrent algorithms, emphasizing those suitable for use in distributed networks. Process synchronization, allocation of computational resources, distributed consensus, distributed graph algorithms, election of a leader in a network, distributed termination, deadlock detection, concurrency control, communication, and clock synchronization. Special consideration given to issues of efficiency and fault tolerance. Formal models and proof methods for distributed computation.

This class has 6.046 as a prerequisite.

6.852 will be offered this semester (Fall 2017). It is instructed by N. A. Lynch.

Lecture occurs 11:00 AM to 12:30 PM on Tuesdays and Thursdays in 32-144.

This class counts for a total of 12 credits.

In the Fall 2015 Subject Evaluations, 6.852 was rated 6.3 out of 7.0. You can find more information at the Class Page site or on the 6.852 Stellar site.

MIT 6.852 Distributed Algorithms Related Textbooks
MIT 6.852 Distributed Algorithms On The Web
Class Page
Tags
restricted materials usage

18.404 Theory of Computation

Class Info

A more extensive and theoretical treatment of the material in 6.045J/18.400J, emphasizing computability and computational complexity theory. Regular and context-free languages. Decidable and undecidable problems, reducibility, recursive function theory. Time and space measures on computation, completeness, hierarchy theorems, inherently complex problems, oracles, probabilistic computation, and interactive proof systems.

This class has 18.200, and 18.062J as prerequisites.

18.404 will be offered this semester (Fall 2017). It is instructed by M. Sipser.

Lecture occurs 2:30 PM to 4:00 PM on Tuesdays and Thursdays in 2-190.

This class counts for a total of 12 credits.

You can find more information at the http://www.google.com/search?&q=MIT+%2B+18.404&btnG=Google+Search&inurl=https site or on the 18.404 Stellar site.

Required Textbooks
Save up to up to 93% by purchasing through MIT Textbooks!
MIT 18.404 Theory of Computation Related Textbooks

© Copyright 2015