We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
—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...
We present the theory for heteroscedastic discriminant analysis (HDA), a model-based generalization of linear discriminant analysis (LDA) derived in the maximum-likelihood framewo...
We present a comprehensive approach to address three challenging problems in face recognition: modelling faces across multi-views, extracting the non-linear discriminating feature...
We present methods for training high quality object detectors
very quickly. The core contribution is a pair of fast
training algorithms for piece-wise linear classifiers, which
...