1248 search results - page 12 / 250 » On the Number of Birch Partitions |
168
click to vote
DAM
2007
15 years 6 months ago
2007
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
151
click to vote
JCT
2006
15 years 6 months ago
2006
We investigate the number of different ways in which a rectangle containing a set of n noncorectilinear points can be partitioned into smaller rectangles by n (non-intersecting) s...
174
click to vote
CPC
2004
15 years 5 months ago
2004
The strong chromatic number, S(G), of an n-vertex graph G is the smallest number k such that after adding kn/k-n isolated vertices to G and considering any partition of the vertic...
165
click to vote
ACIVS
2008
Springer
16 years 12 days ago
2008
Springer
Bayesian Information Criterion (BIC) is a promising method for detecting the number of clusters. It is often used in model-based clustering in which a decisive first local maximum ...
171
click to vote
RTCSA
2005
IEEE
15 years 11 months ago
2005
IEEE
In some real-time application systems, there are only a few distinct kinds of tasks, each of which may be instantiated several times during runtime. The scheduling of such sporadi...