Sciweavers

1154 search results - page 211 / 231
» On the editing distance of graphs
Sort
View
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
14 years 1 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
HT
2005
ACM
14 years 1 months ago
Evaluation of adaptive hypermedia systems' conversion
Conversion between different adaptive hypermedia systems has barely been proposed, yet alone tested in realistic settings. This paper presents the evaluation of the interoperabili...
Alexandra I. Cristea, Helen Ashman, Craig D. Stewa...
APPROX
2005
Springer
106views Algorithms» more  APPROX 2005»
14 years 1 months ago
Derandomized Constructions of k-Wise (Almost) Independent Permutations
Constructions of k-wise almost independent permutations have been receiving a growing amount of attention in recent years. However, unlike the case of k-wise independent functions...
Eyal Kaplan, Moni Naor, Omer Reingold
COMPGEOM
2004
ACM
14 years 29 days ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
DIALM
2004
ACM
165views Algorithms» more  DIALM 2004»
14 years 29 days ago
LLS: a locality aware location service for mobile ad hoc networks
Coping with mobility and dynamism is one of the biggest challenges in ad hoc networks. An essential requirement for such networks is a service that can establish communication ses...
Ittai Abraham, Danny Dolev, Dahlia Malkhi