We introduce the problem of grammar mining, where patterns are context-free grammars, as a generalization of a large number of common pattern mining tasks, such as tree, sequence ...
We explore generic mechanisms to introduce structural hints into the method of Unsupervised Kernel Regression (UKR) in order to learn representations of data sequences in a semi-su...
Jan Steffen, Stefan Klanke, Sethu Vijayakumar, Hel...
Estimating mode (walking/running/standing) and phases of human locomotion is important for video understanding. We present a new ”tracking as recognition” approach. A hierarch...
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of d...