but if is considered more readable in some situations.

Under what conditions do we attribute humanlikeness to nonhumans? A living being isn't necessarily humanlike. That is, we can be animistic without being anthropomorphic. Here are some conditions for ...

``By itself, this meter does nothing.''-- Excerpt from a disclaimer found in every E-meter book, and on the device itself. In this photo, a course supervisor monitors the performance of student ...

Martial Hebert became dean of Carnegie Mellon University's world-renowned School of Computer Science in August 2019. A leading researcher in computer vision and robotics, he's the sixth dean to lead ...

AI for Teachers supports high school educators who want to gain familiarity with AI and offer AI-related educational activities for their students. The workshop covers an introduction to a broad range ...

I am an entering freshman in SCS. How do I become an AI major? All incoming SCS students start their first year as undeclared majors and take roughly the same curriculum during their first year. In ...

The HCII doctoral program offers an inspiring, collaborative and supportive atmosphere for graduate study. Our doctoral students engage in research from the moment they arrive, and take courses from ...

This paper describes a method for efficiently computing parallel transport of tangent vectors on curved surfaces, or more generally, any vector-valued data on a curved manifold. More precisely, it ...

I'm a professor in the Machine Learning Department at Carnegie Mellon. I am also affiliated with the Robotics Institute. I'm interested in multi-agent planning, reinforcement learning, ...

This is a preliminary glimpse of a graphical knowledge graph exploration tool being developed by AI-CARING, an NSF AI Institute. Demos currently available: ...

Michael Garland and Paul S. Heckbert, SIGGRAPH 97. The text of this article is available in both PDF and PostScript formats. The PDF file is recommended. It is much smaller and will reproduce well on ...

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: ...