1346 search results - page 40 / 270 » On the number of rectangular partitions |
IPPS
2000
IEEE
13 years 11 months ago
2000
IEEE
Many techniques for increasing the amount of instruction-level parallelism (ILP) put increased pressure on the registers inside a CPU. These techniques allow for more operations t...
SIAMCOMP
1998
13 years 7 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
ICIP
2002
IEEE
14 years 9 months ago
2002
IEEE
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs...
CGF
2008
13 years 7 months ago
2008
We describe algorithms for canonically partitioning semi-regular quadrilateral meshes into structured submeshes, using an adaptation of the geometric motorcycle graph of Eppstein ...
DAM
1998
13 years 7 months ago
1998
We give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, l − 1, n − 1). The number P(k, l, n) counts noncrossing partitions of {1, 2, . . ...