4131 search results - page 380 / 827 » Compactness in Topology and Computation |
167
click to vote
GLVLSI
2009
IEEE
2009
IEEE
On the complexity of graph cuboidal dual problems for 3-D floorplanning of integrated circuit design
16 years 1 months ago
This paper discusses the impact of migrating from 2-D to 3-D on floorplanning and placement. By looking at a basic formulation of graph cuboidal dual problem, we show that the 3-...
184
Voted
SPAA
2004
ACM
16 years 6 days ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
178
click to vote
IPPS
2003
IEEE
16 years 2 days ago
2003
IEEE
Clusters of PC containing mostly general purpose hardware have become more and more usable for high performance computing tasks in the past few years. Clustering existing systems ...
188
click to vote
DAC
2000
ACM
15 years 11 months ago
2000
ACM
The ordered tree (O-tree) representation has recently gained much interest in layout design automation. Different from previous topological representations of non-slicing floorpl...
181
click to vote
SIGGRAPH
2000
ACM
15 years 11 months ago
2000
ACM
We propose a new progressive compression scheme for arbitrary topology, highly detailed and densely sampled meshes arising from geometry scanning. We observe that meshes consist o...