Sciweavers

740 search results - page 59 / 148
» Recursive layout generation
Sort
View
103
Voted
MEMBRANE
2004
Springer
15 years 6 months ago
Communicative P Systems with Minimal Cooperation
We proved that two classes of Communicative P systems with 3 membranes and with minimal cooperation, namely P systems with symport/antiport rules of size 1 and and P systems with s...
Artiom Alhazov, Maurice Margenstern, Vladimir Rogo...
JCT
2011
84views more  JCT 2011»
14 years 7 months ago
Explicit separating invariants for cyclic P-groups
Abstract. We consider a finite dimensional indecomposable modular representation of a cyclic p-group and we give a recursive description of an associated separating set: We show t...
Müfit Sezer
76
Voted
DATE
2005
IEEE
124views Hardware» more  DATE 2005»
15 years 6 months ago
Multi-Placement Structures for Fast and Optimized Placement in Analog Circuit Synthesis
This paper presents the novel idea of multi-placement structures, for a fast and optimized placement instantiation in analog circuit synthesis. These structures need to be generat...
Raoul F. Badaoui, Ranga Vemuri
98
Voted
GD
2005
Springer
15 years 6 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
107
Voted
CGF
2010
169views more  CGF 2010»
15 years 22 days ago
Image-Based Edge Bundles: Simplified Visualization of Large Graphs
We present a new approach aimed at understanding the structure of connections in edge-bundling layouts. We combine the advantages of edge bundles with a bundle-centric simplified ...
Alexandru Telea, Ozan Ersoy