This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search technique...
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students. We show...
We present a novel approach for learning patterns (sub-images) shared by multiple images without prior knowledge about the number and the positions of the patterns in the images. ...
We present a method for optimizing the stereo matching process when it is applied to a series of images with similar depth structures. We observe that there are similar regions wit...