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.
I am currently the chair of CATCS . Please check it out - we welcome any suggestions. I was the PC chair of SODA, 2024 . The accepted papers are here. An alternative talk schedule format is here. A ...
Phil Gibbons is a Professor in the Computer Science Department and the Electrical & Computer Engineering Department at Carnegie Mellon University. He received his Ph.D. in Computer Science from the ...
An introductory computer science course for students with little to no computing experience. Students will learn the core elements of programming in Python and will also receive a broad overview of ...
I am looking for new students. My current research focus is enabling robots to learn strategies (tricks, hacks) to do tasks from direct instruction, googling and using the web, observation, and ...
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 ...
I am the Cadence Design Systems Professor of Computer Science at Carnegie Mellon University. My main research interests are in machine learning, artificial intelligence, theoretical computer science, ...
OpenSfM and OpenDroneMap could be used as an alternative for the VisualSFM & CMPMVS process. OpenSfM is a free open source SfM library, which reconstructs only point clouds. OpenDroneMap implements ...
I am a research scientist at Google Brain.
There will be weekly written assignments, starting in the first week of classes. Each written assignment consists of 1-3 questions that require students to write single paragraph answers. They are ...
This paper presents a method for constructing smooth unit n-direction fields (line fields, cross fields, etc.) on surfaces that is an order of magnitude faster than state-of-the-art methods, while ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results