Sciweavers

281 search results - page 25 / 57
» Graph Kernels
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Gradient boosting for kernelized output spaces
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
Florence d'Alché-Buc, Louis Wehenkel, Pierr...
ICCV
2011
IEEE
13 years 9 months ago
A Graph-matching Kernel for Object Categorization
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...
Olivier Duchenne, Armand Joulin, Jean Ponce
GD
2003
Springer
15 years 3 months ago
Fixed Parameter Algorithms for one-sided crossing minimization Revisited
We exhibit a small problem kernel for the one-sided crossing minimization problem. This problem plays an important role in graph drawing algorithms based on the Sugiyama layering ...
Vida Dujmovic, Henning Fernau, Michael Kaufmann
ISAAC
2009
Springer
109views Algorithms» more  ISAAC 2009»
15 years 4 months ago
A Linear Vertex Kernel for Maximum Internal Spanning Tree
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
Fedor V. Fomin, Serge Gaspers, Saket Saurabh, St&e...
WADS
2007
Springer
91views Algorithms» more  WADS 2007»
15 years 3 months ago
Kernelization and Complexity Results for Connectivity Augmentation Problems
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
Jiong Guo, Johannes Uhlmann