1346 search results - page 77 / 270 » On the number of rectangular partitions |
ALGORITHMICA
2002
14 years 9 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
JCO
2002
14 years 9 months ago
2002
SONET(SynchronousOpticalNETworks)add-dropmultiplexers(ADMs)arethedominantcostfactor in the WDM(Wavelength Division Multiplexing)/SONET rings. The number of SONET ADMs required by a...
JCT
1998
14 years 9 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
15 years 4 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...
JCT
2010
14 years 8 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...