Sciweavers

1346 search results - page 16 / 270
» On the number of rectangular partitions
Sort
View
SIAMSC
2010
210views more  SIAMSC 2010»
14 years 4 months ago
On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe
We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation. We present three hypergraph-partitioning-based methods, ea...
Ümit V. Çatalyürek, Cevdet Aykana...
ISPD
2004
ACM
150views Hardware» more  ISPD 2004»
15 years 3 months ago
Topology optimization of structured power/ground networks
This paper presents an efficient method for optimizing the design of power/ground (P/G) networks by using locally regular, globally irregular grids. The procedure divides the pow...
Jaskirat Singh, Sachin S. Sapatnekar
83
Voted
EOR
2007
88views more  EOR 2007»
14 years 9 months ago
The minimum size instance of a Pallet Loading Problem equivalence class
The Pallet Loading Problem (PLP) maximizes the number of identical rectangular boxes placed within a rectangular pallet. Boxes may be rotated 90° so long as they are packed with ...
Gustavo H. A. Martins, Robert F. Dell
ICIP
2006
IEEE
15 years 11 months ago
Redundancy in All Pairs Fast Marching Method
In this paper, we analyze the redundancy in calculating all pairs of geodesic distances on a rectangular grid. Fast marching method is an efficient way to estimate the geodesic di...
Luca Bertelli, Baris Sumengen, B. S. Manjunath
56
Voted
COMPGEOM
2004
ACM
15 years 3 months ago
Pushing squares around
We study dynamic self-reconfiguration of modular metamorphic systems. We guarantee the feasibility of motion planning in a rectangular model consisting of square modules that are...
Adrian Dumitrescu, János Pach