Convolution kernels for trees provide simple means for learning with tree-structured data. The computation time of tree kernels is quadratic in the size of the trees, since all pa...
Konrad Rieck, Tammo Krueger, Ulf Brefeld, Klaus-Ro...
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
Tammy Riklin Raviv, Vebjorn Ljosa, Annie L. Conery...
—A spatiotemporal saliency algorithm based on a center-surround framework is proposed. The algorithm is inspired by biological mechanisms of motion-based perceptual grouping and ...
Researchers have developed a number of runtime verification tools that generate runtime monitors in the form of AspectJ aspects. In this work, we present Clara, a novel framework ...
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...