Sciweavers

515 search results - page 28 / 103
» Layouts of Expander Graphs
Sort
View
IWPC
2005
IEEE
14 years 3 months ago
Clustering Software Artifacts Based on Frequent Common Changes
Changes of software systems are less expensive and less error-prone if they affect only one subsystem. Thus, clusters of artifacts that are frequently changed together are subsyst...
Dirk Beyer, Andreas Noack
ISCI
2007
96views more  ISCI 2007»
13 years 9 months ago
A new algorithm for removing node overlapping in graph visualization
Techniques for drawing graphs have proven successful in producing good layouts of undirected graphs. When nodes must be labeled however, the problem of overlapping nodes arises, p...
Xiaodi Huang, Wei Lai, A. S. M. Sajeev, Junbin Gao
ASPDAC
2008
ACM
86views Hardware» more  ASPDAC 2008»
13 years 11 months ago
An MILP-based wire spreading algorithm for PSM-aware layout modification
Phase shifting mask (PSM) is a promising resolution enhancement technique, which is used in the deep sub-wavelength lithography of the VLSI fabrication process. However, applying ...
Ming-Chao Tsai, Yung-Chia Lin, Ting-Chi Wang
ASSETS
2010
ACM
13 years 10 months ago
Customizable keyboard
Customizable Keyboard is an on-screen keyboard designed to be flexible and expandable. Instead of giving the user a keyboard layout Customizable Keyboard allows the user to create...
Eric S. Missimer, Samuel Epstein, John J. Magee, M...
GD
1995
Springer
14 years 1 months ago
Fast Interactive 3-D Graph Visualization
We present a 3-D version of GEM [6], a randomized adaptive layout algorithm for nicely drawing undirected graphs, based on the spring-embedder paradigm [4]. The new version, GEM-3D...
Ingo Bruß, Arne Frick