Sciweavers

455 search results - page 47 / 91
» Improved Force-Directed Layouts
Sort
View
JPDC
2006
134views more  JPDC 2006»
14 years 9 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
VLSID
2002
IEEE
106views VLSI» more  VLSID 2002»
15 years 10 months ago
SWASAD: An ASIC Design for High Speed DNA Sequence Matching
This paper presents the Smith and Waterman Algorithm-Specific ASIC Design (SWASAD) project. This is a hardware solution that implements the S&W algorithm.. The SWASAD is an imp...
Tony Han, Sri Parameswaran
VLSID
2002
IEEE
116views VLSI» more  VLSID 2002»
15 years 10 months ago
Efficient Macromodeling for On-Chip Interconnects
The improved T and improved n models are proposed for onchip interconnect macromodeling. Using global approximations, simple approximation frames are derived and applied to modeli...
Qinwei Xu, Pinaki Mazumder
ICCAD
2003
IEEE
117views Hardware» more  ICCAD 2003»
15 years 6 months ago
On Whitespace and Stability in Mixed-Size Placement and Physical Synthesis
In the context of physical synthesis, large-scale standard-cell placement algorithms must facilitate incremental changes to layout, both local and global. In particular, flexible...
Saurabh N. Adya, Igor L. Markov, Paul Villarrubia
SOSP
2009
ACM
15 years 6 months ago
Modular data storage with Anvil
Databases have achieved orders-of-magnitude performance improvements by changing the layout of stored data – for instance, by arranging data in columns or compressing it before ...
Mike Mammarella, Shant Hovsepian, Eddie Kohler