561 search results - page 67 / 113 » Shortest-Path Kernels on Graphs |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Previous studies on multi-instance learning typically treated instances in the bags as independently and identically distributed. The instances in a bag, however, are rarely indep...
SODA
2012
ACM
13 years 4 days ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
ICML
2003
IEEE
15 years 10 months ago
2003
IEEE
A new kernel function between two labeled graphs is presented. Feature vectors are defined as the counts of label paths produced by random walks on graphs. The kernel computation ...