Sciweavers

525 search results - page 7 / 105
» Improved Circular Layouts
Sort
View
SIAMCOMP
2002
73views more  SIAMCOMP 2002»
13 years 7 months ago
Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
Guy Even, Sudipto Guha, Baruch Schieber
GD
2006
Springer
13 years 11 months ago
Integrating Edge Routing into Force-Directed Layout
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
Tim Dwyer, Kim Marriott, Michael Wybrow
INFOCOM
2009
IEEE
14 years 2 months ago
Assessing the Vulnerability of the Fiber Infrastructure to Disasters
—Communication networks are vulnerable to natural disasters, such as earthquakes or floods, as well as to physical attacks, such as an Electromagnetic Pulse (EMP) attack. Such r...
Sebastian Neumayer, Gil Zussman, Reuven Cohen, Eyt...
ICIP
2006
IEEE
14 years 9 months ago
Deconvolution Method for View Interpolation Using Multiple Images of Circular Camera Array
This paper deals with a view interpolation problem using multiple images captured with a circular camera array. A novel deconvolution method for reconstructing a virtual image at ...
Akira Kubota, Kazuya Kodama, Yoshinori Hatori
APPROX
1998
Springer
150views Algorithms» more  APPROX 1998»
13 years 11 months ago
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
Vijay Kumar