Sciweavers

369 search results - page 60 / 74
» Layouts of Graph Subdivisions
Sort
View
GD
2005
Springer
14 years 2 months ago
Fast Node Overlap Removal
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...
Tim Dwyer, Kim Marriott, Peter J. Stuckey
ICSE
2001
IEEE-ACM
14 years 1 months ago
A Scalable Formal Method for Design and Automatic Checking of User Interfaces
The paper addresses the formal specification, design and implementation of the behavioral component of graphical user interfaces. The complex sequences of visual events and action...
Jean Berstel, Stefano Crespi-Reghizzi, Gilles Rous...
SOFTVIS
2010
ACM
13 years 8 months ago
Embedding spatial software visualization in the IDE: an exploratory study
Software visualization can be of great use for understanding and exploring a software system in an intuitive manner. Spatial representation of software is a promising approach of ...
Adrian Kuhn, David Erni, Oscar Nierstrasz
CVPR
2010
IEEE
14 years 4 months ago
Collect-Cut: Segmentation with Top-Down Cues Discovered in Multi-Object Images
We present a method to segment a collection of unlabeled images while exploiting automatically discovered appearance patterns shared between them. Given an unlabeled pool of multi...
Yong Jae Lee, Kristen Grauman
ICCAD
1999
IEEE
120views Hardware» more  ICCAD 1999»
14 years 29 days ago
Regularity extraction via clan-based structural circuit decomposition
Identifying repeating structural regularities in circuits allows the minimization of synthesis, optimization, and layout e orts. We introduce in this paper a novel method for ident...
Soha Hassoun, Carolyn McCreary