176 search results - page 13 / 36 » A Problem Kernelization for Graph Packing |
FSTTCS
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We describe some new, simple and apparently general methods for designing FPT algorithms, and illustrate how these can be used to obtain a signi cantly improved FPT algor...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
CPM
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
ALGORITHMICA
2008
13 years 7 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
PAKDD
2007
ACM
14 years 1 months ago
2007
ACM
Convolution kernels, constructed by convolution of sub-kernels defined on sub-structures of composite objects, are widely used in classification, where one important issue is to ch...