1542 search results - page 54 / 309 » Kernelization of packing problems |
TCS
2008
14 years 11 months ago
2008
Online unit clustering is a clustering problem where classification of points is done in an online fashion, but the exact location of clusters can be modified dynamically. We stud...
ICDM
2005
IEEE
15 years 5 months ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...
ESA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We show that the k-Dominating Set problem is fixed parameter tractable (FPT) and has a polynomial kernel for any class of
RECOMB
2004
Springer
16 years 4 days ago
2004
Springer
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
CPM
2005
Springer
15 years 5 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...