Sciweavers

2635 search results - page 18 / 527
» Algorithms for the Database Layout Problem
Sort
View
ISPD
1998
ACM
128views Hardware» more  ISPD 1998»
15 years 8 months ago
Topology constrained rectilinear block packing for layout reuse
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...
Maggie Zhiwei Kang, Wayne Wei-Ming Dai
FAW
2009
Springer
177views Algorithms» more  FAW 2009»
15 years 11 months ago
Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
Mohammad Khairul Hasan, Sung-Eui Yoon, Kyung-Yong ...
ISCAS
1994
IEEE
93views Hardware» more  ISCAS 1994»
15 years 8 months ago
The Dynamic Locking Heuristic - A New Graph Partitioning Algorithm
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
Achim G. Hoffmann
GMP
2006
IEEE
120views Solid Modeling» more  GMP 2006»
15 years 10 months ago
Spectral Sequencing Based on Graph Distance
The construction of linear mesh layouts has found various applications, such as implicit mesh filtering and mesh streaming, where a variety of layout quality criteria, e.g., span ...
Rong Liu, Hao Zhang 0002, Oliver van Kaick
CGI
2003
IEEE
15 years 9 months ago
Visualization of Distributed Processes Using "Data Jewelry Box" Algorithm
Visualization of distributed processes is useful for the management of large-scale distributed computing systems. Reactivity and scalability are especially important requirements ...
Yumi Yamaguchi, Takayuki Itoh