1346 search results - page 36 / 270 » On the number of rectangular partitions |
COMGEO
2006
ACM
13 years 7 months ago
2006
ACM
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
JCT
1998
13 years 7 months ago
1998
Let Q(N) denote the number of partitions of N into distinct parts. If ω(k) := 3k2 +k 2 , then it is well known that Q(N) + ∞X k=1 (−1)k “ Q(N − 2ω(k)) + Q(N − 2ω(−k)...
DAC
1997
ACM
13 years 11 months ago
1997
ACM
In this paper, we present a new integrated synthesis and partitioning method for multiple-FPGA applications. This method rst synthesizes a design speci cation in a ne-grained way ...
KR
2000
Springer
13 years 11 months ago
2000
Springer
We investigate the problem of reasoning with partitions of related logical axioms. Our motivation is two-fold. First, we are concerned with how to reason effectively with multiple...
ISAAC
2005
Springer
14 years 27 days ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...