Sciweavers

605 search results - page 83 / 121
» Constrained Graph Layout
Sort
View
ICCAD
2006
IEEE
107views Hardware» more  ICCAD 2006»
14 years 6 months ago
Current path analysis for electrostatic discharge protection
The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer circuit design. High voltages resulted from ESD might cause high current densitie...
Hung-Yi Liu, Chung-Wei Lin, Szu-Jui Chou, Wei-Ting...
AAAI
2008
14 years 6 days ago
Efficient Optimization of Information-Theoretic Exploration in SLAM
We present a novel method for information-theoretic exploration, leveraging recent work on mapping and localization. We describe exploration as the constrained optimization proble...
Thomas Kollar, Nicholas Roy
ICALP
2011
Springer
13 years 1 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli
WWW
2001
ACM
14 years 10 months ago
A constraint extension to scalable vector graphics
Scalable Vector Graphics (SVG) is a language developed by the World Wide Web Consortium for describing two dimensional vector graphics for storage and distribution on the Web. Unl...
Greg J. Badros, Jojada J. Tirtowidjojo, Kim Marrio...
ISPD
2003
ACM
88views Hardware» more  ISPD 2003»
14 years 3 months ago
Porosity aware buffered steiner tree construction
— In order to achieve timing closure on increasingly complex IC designs, buffer insertion needs to be performed on thousands of nets within an integrated physical synthesis syste...
Charles J. Alpert, Gopal Gandham, Milos Hrkic, Jia...