Sciweavers

2365 search results - page 53 / 473
» All things are connected
Sort
View
APPROX
2006
Springer
234views Algorithms» more  APPROX 2006»
15 years 5 months ago
Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs
For a given graph with weighted vertices, the goal of the minimum-weight dominating set problem is to compute a vertex subset of smallest weight such that each vertex of the graph...
Christoph Ambühl, Thomas Erlebach, Matú...
GIS
2008
ACM
15 years 2 months ago
Automatic extraction of road intersection position, connectivity, and orientations from raster maps
The road network is one of the most important types of information on raster maps. In particular, the set of road intersection templates, which consists of the road intersection p...
Yao-Yi Chiang, Craig A. Knoblock
CN
2008
106views more  CN 2008»
15 years 1 months ago
TCP with gateway adaptive pacing for multihop wireless networks with Internet connectivity
This paper introduces an effective congestion control pacing scheme for TCP over multihop wireless networks with Internet connectivity. The pacing scheme is implemented at the wir...
Sherif M. ElRakabawy, Alexander Klemm, Christoph L...
TON
2008
109views more  TON 2008»
15 years 1 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
WG
2010
Springer
14 years 11 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...