1027 search results - page 124 / 206 » Ordered Vertex Partitioning |
RSA
2010
13 years 7 months ago
2010
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
ICDM
2009
IEEE
14 years 3 months ago
2009
IEEE
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
DATE
2005
IEEE
14 years 2 months ago
2005
IEEE
One of the greatest impediments to achieving high quality placements using force-directed methods lies in the large amount of overlap initially present in these techniques. This o...
ISPD
1998
ACM
14 years 1 months ago
1998
ACM
In this paper, we formulate the problem of topology constrained rectilinear block packing in layout reuse. A speci c class of rectilinear shaped blocks, ordered convex rectilinear...
JMIV
2008
13 years 9 months ago
2008
We introduce a practical and improved version of the Polyharmonic Local Sine transform (PHLST) called PHLST5. After partitioning an input image into a set of rectangular blocks, t...