MLD Ph.D. student Aakash Lahoti has been named a 2025-2026 Jump Trading Fellow for his work on building efficient, effective sequence-to-sequence models that can handle very long inputs.

This data set contains WWW-pages collected from computer science departments of various universities in January 1997 by the World Wide Knowledge Base (Web->Kb) project of the CMU text learning group.

Frank Pfenning Personal Home PageSubstructural Type Systems Tutorial at POPL 2025 (introductory AI-generated podcast) (live code) Adjoint Natural Deduction (Extended Version) Junyoung Jang, Sophia ...

This course provides a comprehensive introduction to computer vision. Major topics include image processing, detection and recognition, geometry-based and physics-based vision and video analysis.

What about ChatGPT and related large AI Systems? How will they impact us all? As a longtime researcher in AI, I'm excited about the ways in which these new AI systems can improve our healthcare, ...

Because of the many requests for this material, we are pleased to make available an online version of some of our printed lecture notes on ``An Introduction to ...

This page links to the individual websites for various instances of this course. Fall 2025 Taught by Daniel Anderson and Danny Sleator Spring 2025 Taught by Daniel Anderson and David Woodruff Fall ...

Designing Deep Networks for Surface Normal Estimation. Conference on Computer Vision and Pattern Recognition (CVPR), 2015. [pdf] [BibTeX] [results for NYU Depth V2] [code and models] [project page] ...

I am currently working at Snowflake as a Postdoctoral Research Fellow. I will join Tsinghua IIIS as an Assistant Professor in Spring 2021. I received my Ph.D. degree from the Computer Science ...

15-451/651 is an advanced undergraduate/masters algorithms class. We cover fundamental algorithmic modeling techniques (e.g. dynamic programming, graphs, network flows, linear programming), advanced ...

This course covers the design and implementation of compiler and runtime systems for high-level languages, and examines the interaction between language design, compiler design, and runtime ...

The area of approximation algorithms is aimed at giving provable guarantees on the performance of heuristics for hard problems. The course will present general techniques (such as convex ...