SCS researchers, including CSD's Guying Lin (shown), have developed a new scene-generation framework that creates physically realistic, simulation-ready 3D scenes from text prompts. PAT3D generates 3D ...
A triangular mesh generator rests on the efficiency of its triangulation algorithms and data structures, so I discuss these first. I assume the reader is familiar with Delaunay triangulations, ...
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 ...
GiRaF is a computational tool for identification of reassortments in influenza viruses from sequence databases of isolates. Reassortments in influenza - a process where strains exchange genetic ...
Welcome to my website. I am an Associate Professor at Carnegie Mellon University's Robotics Institute. My research focuses on legged systems. I work on principles of legged dynamics and control, their ...
We introduce the heat method for solving the single- or multiple-source shortest path problem on both flat and curved domains. A key insight is that distance computation can be split into two stages: ...
Nyquist is a language for sound synthesis and music composition. Unlike score languages that tend to deal only with events, or signal processing languages that tend to deal only with signals and ...
Meetings time and place: Monday and Wednesday, 3pm-4:20pm, GHC 5222.
This course teaches imperative programming in a C-like language and methods for ensuring the correctness of imperative programs. It is intended for students who are familiar with elementary ...
Hi there! I am an assistant teaching professor in the machine learning department at Carnegie Mellon University. I primarily teach the department's various Introduction to Machine Learning courses. In ...
Machine translation Neural network models for language processing Computational morphology and phonology NLP on noisy text (Twitter, Sina Weibo, etc.) Language modeling Feature induction and ...
We describe a discrete Laplacian suitable for any triangle mesh, including those that are nonmanifold or nonorientable (with or without boundary). Our Laplacian is a robust drop-in replacement for the ...