482 search results - page 31 / 97 » A Linear-Time Graph Kernel |
125
Voted
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
Weighted graph regularization provides a rich framework that allows to regularize functions defined over the vertices of a weighted graph. Until now, such a framework has been only...
152
Voted
FSTTCS
2010
Springer
15 years 17 days ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
147
Voted
ICALP
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several c...
106
Voted
NIPS
2007
15 years 4 months ago
2007
This paper introduces kernels on attributed pointsets, which are sets of vectors embedded in an euclidean space. The embedding gives the notion of neighborhood, which is used to d...
110
Voted
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
Given a large, real graph, how can we generate a synthetic graph that matches its properties, i.e., it has similar degree distribution, similar (small) diameter, similar spectrum,...