Sciweavers

409 search results - page 76 / 82
» Odd Crossing Number and Crossing Number Are Not the Same
Sort
View
FOCS
2008
IEEE
14 years 1 months ago
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
Venkatesan Guruswami, Rajsekar Manokaran, Prasad R...
ICRA
2008
IEEE
182views Robotics» more  ICRA 2008»
14 years 1 months ago
A body joint improves vertical to horizontal transitions of a wall-climbing robot
— Several recently-designed robots are able to scale steep surfaces using animal-inspired strategies for foot attachment and leg kinematics. These designs could be valuable for r...
Kathryn A. Daltorio, Timothy C. Witushynsky, Grego...
ICC
2007
IEEE
14 years 1 months ago
Optical WDM Network Planning Using Heterogeneous Multi-granularity OXCs
Multigranular optical WDM network aims to reduce network cost by grouping multiple wavelengths and then switching those wavelengths together at waveband or fiber levels. To configu...
Hong-Hsu Yen, Frank Yeong-Sung Lin, Steven S. W. L...
IPPS
2007
IEEE
14 years 1 months ago
Performance Studies of a WebSphere Application, Trade, in Scale-out and Scale-up Environments
Scale-out approach, in contrast to scale-up approach (exploring increasing performance by utilizing more powerful shared-memory servers), refers to deployment of applications on a...
Hao Yu, José E. Moreira, Parijat Dube, I-Hs...
GD
2005
Springer
14 years 1 months ago
Graph Treewidth and Geometric Thickness Parameters
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
Vida Dujmovic, David R. Wood