1964 search results - page 78 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
DAM
2010
13 years 8 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
IJAR
2006
13 years 7 months ago
2006
In this paper we present a multi-scale method based on the hybrid notion of rough fuzzy sets, coming from the combination of two models of uncertainty like vagueness by handling r...
CIKM
2007
Springer
14 years 2 months ago
2007
Springer
In this work, we attempt to tackle domain-transfer problem by combining old-domain labeled examples with new-domain unlabeled ones. The basic idea is to use old-domain-trained cla...
ICDM
2003
IEEE
14 years 1 months ago
2003
IEEE
A data set can be clustered in many ways depending on the clustering algorithm employed, parameter settings used and other factors. Can multiple clusterings be combined so that th...
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an ...