1039 search results - page 23 / 208 » Kernels and Regularization on Graphs |
96
Voted
GBRPR
2009
Springer
15 years 7 months ago
2009
Springer
A large family of shape comparison methods is based on a medial axis transform combined with an encoding of the skeleton by a graph. Despite many qualities this encoding of shapes ...
90
Voted
LATIN
2000
Springer
15 years 4 months ago
2000
Springer
We look at the minimal size of a maximal matching in general, bipartite and
108
click to vote
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the r...
123
click to vote
KDD
2004
ACM
16 years 27 days ago
2004
ACM
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
84
Voted
STOC
2002
ACM
16 years 23 days ago
2002
ACM
We analyze a randomized version of the Brelaz heuristic on sparse random graphs. We prove that almost all graphs with average degree dp4:03; i.e., G?n; p ? d=n?; are 3-colorable a...