482 search results - page 23 / 97 » A Linear-Time Graph Kernel |
CVPR
2007
IEEE
16 years 1 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...
103
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
98
Voted
EJC
2008
14 years 11 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
113
click to vote
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
93
Voted
WG
2010
Springer
14 years 9 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...