2695 search results - page 301 / 539 » Learning Graph Matching |
126
Voted
DAM
2002
15 years 3 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
132
Voted
ENDM
2010
15 years 26 days ago
2010
In this paper we consider the structural analysis problem for differential-algebraic systems with conditional equations. This consists, given a conditional differential algebraic ...
177
Voted
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper presents a novel intrinsic 3D surface distance and its use in a complete probabilistic tracking framework for dynamic 3D data. Registering two frames of a deforming 3D ...
130
Voted
ALT
2004
Springer
16 years 14 days ago
2004
Springer
When applying aggregating strategies to Prediction with Expert Advice, the learning rate must be adaptively tuned. The natural choice of complexity/current loss renders the analys...
143
Voted
JMLR
2008
15 years 3 months ago
2008
We show that the relevant information of a supervised learning problem is contained up to negligible error in a finite number of leading kernel PCA components if the kernel matche...