Contained rewriting and maximal contained rewriting of tree pattern queries using views have been studied recently for the class of tree patterns involving /, //, and []. Given que...
Clustering performance can often be greatly improved by
leveraging side information. In this paper, we consider constrained
clustering with pairwise constraints, which specify
s...
Content-based image retrieval systems still have difficulties to bridge the semantic gap between the low-level representation of images and the high level concepts the user is loo...
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
—We consider the problem of learning a linear combination of pre-specified kernel matrices in the Fisher discriminant analysis setting. Existing methods for such a task impose a...
Fei Yan, Josef Kittler, Krystian Mikolajczyk, Muha...