281 search results - page 14 / 57 » Graph Kernels |
100
click to vote
ICALP
2007
Springer
15 years 4 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...
NIPS
2007
14 years 11 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...
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
We propose a new kernel function for attributed molecular graphs, which is based on the idea of computing an optimal assignment from the atoms of one molecule to those of another ...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems. In a parameterized problem, every in...
NIPS
2004
14 years 11 months ago
2004
We formulate the problem of graph inference where part of the graph is known as a supervised learning problem, and propose an algorithm to solve it. The method involves the learni...