1039 search results - page 78 / 208 » Kernels and Regularization on Graphs |
123
Voted
NIPS
2008
15 years 2 months ago
2008
For supervised and unsupervised learning, positive definite kernels allow to use large and potentially infinite dimensional feature spaces with a computational cost that only depe...
136
click to vote
JMLR
2012
13 years 3 months ago
2012
Metric and kernel learning arise in several machine learning applications. However, most existing metric learning algorithms are limited to learning metrics over low-dimensional d...
112
Voted
CIDM
2009
IEEE
15 years 4 months ago
2009
IEEE
The graph classification problem is learning to classify separate, individual graphs in a graph database into two or more categories. A number of algorithms have been introduced fo...
167
Voted
CAPTECH
1998
Springer
15 years 4 months ago
1998
Springer
A method for matching sequences from two perspective views of a moving person silhouette is presented. Regular (approximate uniform thickness) parts are detected on an image and a ...
123
click to vote
STACS
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...