David Woodruff, a professor in CMU's Computer Science Department, and Samson Zhou from Texas A&M University received a ...

This page is optional reading. Some students wish to know a little more about the Java programming language and this page is the simplest explanation that I can formulate. The textbook doesn't ...

The do special form provides a generalized iteration facility, with an arbitrary number of ``index variables.'' These variables are bound within the iteration and stepped in parallel in specified ways ...

Binds an array to a surface.

Carnegie Mellon is known for its stressful environment, and we realize that the pace and expectations of 15-213/15-513/14-513 can contribute to that stress. If you find yourself having trouble keeping ...

This is a very short 5 minute "executive overview" of the intuition and insight behind Bayesian Networks. Read the full Bayes Net Tutorial for more information.

This tutorial steps through the ideas from Information Theory that eventually lead to Information Gain...one of the most popular measures of association currently used in data mining. We visit the ...

We review methods described in other biosurveillance slides as applied to hospital admissions data from the Walkerton Cryptosporidium outbreak of 2000. This is work performed as part of the ECADS ...

The tutorial teaches concepts from the AI literature on Constraint Satisfaction. Accompanying animations are in http://www.cs.cmu.edu/~awm/animations/constraint. This ...

Fully programmable and adaptive light curtains for object detection on any ruled surface. A vehicle on a road or a robot in the field does not need a full-featured 3D depth sensor to detect potential ...

In this tutorial we'll begin by reviewing Markov Models (aka Markov Chains) and then...we'll hide them! This simulates a very common phenomenon... there is some underlying dynamic system running along ...

We review the idea of the margin of a classifier, and why that may be a good criterion for measuring a classifier's desirability. Then we consider the computational problem of finding the largest ...