1964 search results - page 137 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
CEC
2007
IEEE
14 years 2 months ago
2007
IEEE
— One of the main tasks software testing involves is the generation of the test cases to be used during the test. Due to its expensive cost, the automation of this task has becom...
ISAAC
2009
Springer
14 years 2 months ago
2009
Springer
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a ne...
ICMLA
2008
13 years 9 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
In kernel methods, an interesting recent development seeks to learn a good kernel from empirical data automatically. In this paper, by regarding the transductive learning of the k...
CAIP
2009
Springer
13 years 5 months ago
2009
Springer
This paper describes a method for seamless enlargement or editing of difficult colour textures containing simultaneously both regular periodic and stochastic components. Such textu...