Sciweavers

1830 search results - page 189 / 366
» Workshop on Graph Computation Models
Sort
View
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
16 years 27 days ago
A matching based decomposer for double patterning lithography
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
Yue Xu, Chris Chu
182
Voted
NCA
2007
IEEE
16 years 9 days ago
On the Evaluation of Shortest Journeys in Dynamic Networks
The assessment of routing protocols for wireless networks is a difficult task, because of the networks’ highly dynamic behavior and the absence of benchmarks. However, some of ...
Afonso Ferreira, Alfredo Goldman, Julian Monteiro
WCNC
2010
IEEE
15 years 10 months ago
Node Connectivity Analysis in Multi-Hop Wireless Networks
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
Bahador Bakhshi, Siavash Khorsandi
GD
2006
Springer
15 years 9 months ago
Upright-Quad Drawing of st -Planar Learning Spaces
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students. We show...
David Eppstein
GG
2010
Springer
15 years 7 months ago
Local Confluence for Rules with Nested Application Conditions
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
Hartmut Ehrig, Annegret Habel, Leen Lambers, Ferna...