Sciweavers

5889 search results - page 164 / 1178
» Graph Layout Problems
Sort
View
ALGORITHMICA
2006
132views more  ALGORITHMICA 2006»
15 years 4 months ago
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs
Hierarchical graphs and clustered graphs are useful non-classical graph models for structured relational information. Hierarchical graphs are graphs with layering structures; clus...
Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Na...
VLSID
2002
IEEE
92views VLSI» more  VLSID 2002»
16 years 5 months ago
Electromigration Avoidance in Analog Circuits: Two Methodologies for Current-Driven Routing
Interconnect with an insufficient width may be subject to electromigration and eventually cause the failure of the circuit at any time during its lifetime. This problem has gotten...
Jens Lienig, Goeran Jerke, Thorsten Adler
CGI
2003
IEEE
15 years 10 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
PVLDB
2008
117views more  PVLDB 2008»
15 years 4 months ago
Learning to extract form labels
In this paper we describe a new approach to extract element labels from Web form interfaces. Having these labels is a requirement for several techniques that attempt to retrieve a...
Hoa Nguyen, Thanh Hoang Nguyen, Juliana Freire
DAC
2012
ACM
13 years 7 months ago
A metric for layout-friendly microarchitecture optimization in high-level synthesis
In this work we address the problem of managing interconnect timing in high-level synthesis by generating a layoutfriendly microarchitecture. A metric called spreading score is pr...
Jason Cong, Bin Liu