Sciweavers

2680 search results - page 37 / 536
» The topology of the independence complex
Sort
View
ISPD
1998
ACM
128views Hardware» more  ISPD 1998»
14 years 2 months ago
Topology constrained rectilinear block packing for layout reuse
In this paper, we formulate the problem of topology constrained rectilinear block packing in layout reuse. A speci c class of rectilinear shaped blocks, ordered convex rectilinear...
Maggie Zhiwei Kang, Wayne Wei-Ming Dai
MASCOTS
2003
13 years 11 months ago
Toward Scaling Network Emulation using Topology Partitioning
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the n...
Ken Yocum, Ethan Eade, Julius Degesys, David Becke...
CN
2007
95views more  CN 2007»
13 years 10 months ago
Sampling large Internet topologies for simulation purposes
In this paper, we develop methods to ‘‘sample’’ a small realistic graph from a large Internet topology. Despite recent activity, modeling and generation of realistic graph...
Vaishnavi Krishnamurthy, Michalis Faloutsos, Marek...
ISCAS
2007
IEEE
121views Hardware» more  ISCAS 2007»
14 years 4 months ago
Topological Placement with Multiple Symmetry Groups of Devices for Analog Layout Design
Abstract– This paper presents an improved topological algorithm for device-level analog placement with symmetry constraints. Based on the exploration of symmetric-feasible sequen...
Karthik Krishnamoorthy, Sarat C. Maruvada, Florin ...
WDAG
2005
Springer
130views Algorithms» more  WDAG 2005»
14 years 3 months ago
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger...