Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
We have built a system that engages naive users in an audiovisual interaction with a computer in an unconstrained public space. We combine audio source localization techniques wit...
Sunsern Cheamanunkul, Evan Ettinger, Matt Jacobsen...
While algorithms have existed in math, music and other fields for over one thousand years, the use of algorithms to solve problems has become easier than ever before due to the a...
Adam L. Meyers, Marilyn C. Cole, Evan Korth, Sam P...
Abstract. Computational Grids provide a widely distributed computing environment suitable for randomized SAT solving. This paper develops techniques for incorporating learning, kno...