The research areas of plan recognition and natural language parsing share many common features and even algorithms. However, the dialog between these two disciplines has not been ...
We show that an important and computationally challenging solution space feature of the graph coloring problem (COL), namely the number of clusters of solutions, can be accurately...
The stochastic approximation method is behind the solution to many important, actively-studied problems in machine learning. Despite its farreaching application, there is almost n...
Typically, sequence signatures, such as motifs and domains, are assumed to be localized in one region of a sequence or are derived as combinations of the former. We generalize the...
In this paper, we show that we can improve accuracies of 3-D reconstructions with uncalibrated stereo by classifying correspondences between two images. After obtaining initial co...