Sciweavers

482 search results - page 34 / 97
» A Linear-Time Graph Kernel
Sort
View
FOCS
2009
IEEE
15 years 4 months ago
(Meta) Kernelization
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...
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshta...
ICIP
2010
IEEE
14 years 7 months ago
Image partitioning with kernel mapping and graph cuts
A novel multiregion graph cut image partitioning method combined with kernel mapping is presented. A kernel function transforms implicitly the image data into data of a higher dim...
Mohamed Ben Salah, Amar Mitiche, Ismail Ben Ayed
GBRPR
2007
Springer
15 years 1 months ago
Image Classification Using Marginalized Kernels for Graphs
We propose in this article an image classification technique based on kernel methods and graphs. Our work explores the possibility of applying marginalized kernels to image process...
Emanuel Aldea, Jamal Atif, Isabelle Bloch
ICML
2005
IEEE
15 years 10 months ago
Optimal assignment kernels for attributed molecular graphs
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 ...
Andreas Zell, Florian Sieker, Holger Fröhlich...
ECCC
2010
92views more  ECCC 2010»
14 years 8 months ago
Logspace Versions of the Theorems of Bodlaender and Courcelle
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
Michael Elberfeld, Andreas Jakoby, Till Tantau