Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

64

STACS
2009
Springer

favoriteEmaildiscussreport

87views Theoretical Computer Science» more STACS 2009»

A Polynomial Kernel for Multicut in Trees

15 years 4 months ago

A Polynomial Kernel for Multicut in Trees

Download laic.u-clermont1.fr

Nicolas Bousquet, Jean Daligault, Stéphan T

Real-time Traffic

STACS 2009 | Theoretical Computer Science |

claim paper

Related Content

» Partial Multicuts in Trees

» Semantic Role Labeling Using a GrammarDriven Convolution Tree Kernel

» On the Kernelization Complexity of Colorful Motifs

» Kernelbased Reranking for NamedEntity Extraction

» A Linear Vertex Kernel for Maximum Internal Spanning Tree

» Combining Convolution Kernels Defined on Heterogeneous Substructures

» Kernelization for Convex Recoloring

» Efficient Kernelbased Learning for Trees

» Advanced TreeBased Kernels for Protein Classification

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	STACS
Authors	Nicolas Bousquet, Jean Daligault, Stéphan Thomassé, Anders Yeo

Comments (0)