Sciweavers

1346 search results - page 4 / 270
» On the number of rectangular partitions
Sort
View
ICIP
2008
IEEE
14 years 8 months ago
A near optimal coder for image geometry with adaptive partitioning
In this paper, we present a new framework to compress the geometry of images. This framework generalizes the standard quad partitioning approaches in compression of image geometry ...
Arian Maleki, Morteza Shahram, Gunnar Carlsson
ARSCOM
2002
70views more  ARSCOM 2002»
13 years 6 months ago
On the Number of Graphical Forest Partitions
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...
Deborah A. Frank, Carla D. Savage, James A. Seller...
COMBINATORICS
2004
54views more  COMBINATORICS 2004»
13 years 6 months ago
When Can You Tile a Box With Translates of Two Given Rectangular Bricks?
When can a d-dimensional rectangular box R be tiled by translates of two given d-dimensional rectangular bricks B1 and B2? We prove that R can be tiled by translates of B1 and B2 ...
Richard J. Bower, T. S. Michael
ICCD
2006
IEEE
125views Hardware» more  ICCD 2006»
14 years 3 months ago
Partial Functional Manipulation Based Wirelength Minimization
—In-place flipping of rectangular blocks/cells can potentially reduce the wirelength of a floorplan/placement solution without changing the chip area, In a recent work [Hao 05], ...
Avijit Dutta, David Z. Pan
FCS
2009
13 years 4 months ago
Domination and Independence on the Rectangular Torus by Rooks and Bishops
A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. ...
Joe DeMaio, William Faust