1248 search results - page 66 / 250 » On the Number of Birch Partitions |
JCT
1998
13 years 8 months ago
1998
Given a tournament score sequence s1 ≥ s2 ≥ · · · ≥ sn, we prove that there exists a tournament T on vertex set {1, 2, . . . , n} such that the degree of any vertex i is ...
SMC
2007
IEEE
14 years 3 months ago
2007
IEEE
— An important consideration in clustering is the determination of the correct number of clusters and the appropriate partitioning of a given data set. In this paper, a newly dev...
ICIP
2009
IEEE
13 years 6 months ago
2009
IEEE
In this paper we present a parameter optimisation procedure that is designed to automatically initialise the number of clusters and the initial colour prototypes required by data ...
JCT
2010
13 years 7 months ago
2010
A linear equation L is called k-regular if every k-coloring of the positive integers contains a monochromatic solution to L. Richard Rado conjectured that for every positive intege...
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...