Sciweavers

695 search results - page 52 / 139
» Convex Learning with Invariances
Sort
View
COMBINATORICA
2010
13 years 6 months ago
A note on disjoint arborescences
Recently Kamiyama, Katoh, and Takizawa have shown a theorem on packing arc-disjoint arborescences that is a proper extension of Edmonds' theorem on disjoint spanning branchin...
Satoru Fujishige
ICANN
2010
Springer
13 years 10 months ago
A Bilinear Model for Consistent Topographic Representations
Visual recognition faces the difficult problem of recognizing objects despite the multitude of their appearances. Ample neuroscientific evidence shows that the cortex uses a topogr...
Urs Bergmann, Christoph von der Malsburg
ICASSP
2011
IEEE
13 years 21 days ago
Theoretical analyses on a class of nested RKHS's
One of central topics of kernel machines in the field of machine learning is a model selection, especially a selection of a kernel or its parameters. In our previous work, we dis...
Akira Tanaka, Hideyuki Imai, Mineichi Kudo, Masaak...
ICML
2009
IEEE
14 years 3 months ago
Online learning by ellipsoid method
In this work, we extend the ellipsoid method, which was originally designed for convex optimization, for online learning. The key idea is to approximate by an ellipsoid the classi...
Liu Yang, Rong Jin, Jieping Ye
ICPR
2006
IEEE
14 years 10 months ago
Fast, Illumination Insensitive Face Detection Based on Multilinear Techniques and Curvature Features
This paper brings together two recent developments in image analysis. We consider a new mathematical framework that provides illumination invariant descriptors for face detection....
Christian Bauckhage, Thomas Käster