Sciweavers

477 search results - page 4 / 96
» Removing even crossings
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
Computing Geometric Minimum-Dilation Graphs Is NP-Hard
We prove that computing a geometric minimum-dilation graph on a given set of points in the plane, using not more than a given number of edges, is an NP-hard problem, no matter if ...
Rolf Klein, Martin Kutz
MMB
2010
Springer
182views Communications» more  MMB 2010»
13 years 11 months ago
CrossTrace: Cross-Layer Measurement for IEEE 802.11 Wireless Testbeds
In this paper, we introduce and evaluate CrossTrace, a framework for performing cross-layer measurements in IEEE 802.11 based wireless networks. CrossTrace allows tracing of parame...
Simon Frohn, Sascha Gübner, Christoph Lindema...
ICC
1997
IEEE
13 years 11 months ago
Removing Instability and Maximizing Throughput in a Multicast Shuffle-Exchange Network
Multicast capability can be incorporated into any interconnection networks by using a general packet replication scheme previously proposed in [4]. The network can then be used fo...
Cathy W. Chan, Soung C. Liew
IROS
2008
IEEE
156views Robotics» more  IROS 2008»
14 years 1 months ago
Cross-country obstacle detection: Space-variant resolution and outliers removal
Abstract— The unstructured nature of cross-country environments poses a great deal of challenges to obstacle detection algorithms. This paper presents an algorithm able to perfor...
Pedro Santana, Paulo Santos, Luís Correia, ...