482 search results - page 15 / 97 » A Linear-Time Graph Kernel |
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Given a bipartite graph of collaborative ratings, the task of recommendation and rating prediction can be modeled with graph kernels. We interpret these graph kernels as the inver...
CAIP
2009
Springer
15 years 1 months ago
2009
Springer
The medial axis being an homotopic transformation, the skeleton of a 2D shape corresponds to a planar graph having one face for each hole of the shape and one node for each junctio...
WG
2007
Springer
15 years 3 months ago
2007
Springer
A circular-arc model M = (C, A) is a circle C together with a collection A of arcs of C. If no arc is contained in any other then M is a proper circular-arc model, if every arc has...
103
Voted
TIT
2008
14 years 9 months ago
2008
We consider a framework for semi-supervised learning using spectral decomposition-based unsupervised kernel design. We relate this approach to previously proposed semi-supervised l...
COCOON
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we give linear time algorithms to decide core stability, core largeness, exactness, and extendability of flow games on uniform networks (all edge capacities are 1)....