We consider a generalization of the shortest-path problem: given an alphabet , a graph G whose edges are weighted and -labeled, and a regular language L , the L-constrained shortes...
Christopher L. Barrett, Keith R. Bisset, Martin Ho...
Dependency-based representations of natural language syntax require a fine balance between structural flexibility and computational complexity. In previous work, several constra...
A collaboration between simulationists and scientists working on fire spread and ecology led to the design of a 3D visualization tool. This tool is a post-processor which can be l...
Alexandre Muzy, David R. C. Hill, Mathieu Joubert,...
Current object recognition systems can only recognize a limited number of object categories; scaling up to many categories is the next challenge. We seek to build a system to reco...
Bryan C. Russell, Antonio Torralba, Ce Liu, Robert...
In many machine learning problems, labeled training data is limited but unlabeled data is ample. Some of these problems have instances that can be factored into multiple views, ea...