549 search results - page 20 / 110 » Computing All the Best Swap Edges Distributively |
AINA
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper we propose a distributed, self organizing, robust and energy efficient data gathering algorithm for sensor networks operating in environments where all the sensor n...
119
click to vote
COMGEO
2007
ACM
14 years 12 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
107
click to vote
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
COMGEO
2007
ACM
14 years 12 months ago
2007
ACM
Snap rounding is a method for converting arbitrary-precision arrangements of segments into fixed-precision representation. We present an algorithm for snap rounding with running ...
CLUSTER
2002
IEEE
15 years 4 months ago
2002
IEEE
In modern clustering environments where the memory hierarchy has many layers (distributed memory, shared memory layer, cache, ¡ ¢ ), an important question is how to fully u...