7 search results - page 1 / 2 » Tight bounds for connecting sites across barriers |
COMPGEOM
2006
ACM
13 years 11 months ago
2006
ACM
WADS
2007
Springer
13 years 11 months ago
2007
Springer
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...
ESA
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subd...
SOSP
2001
ACM
14 years 1 months ago
2001
ACM
As raw system and network performance continues to improve at exponential rates, the utility of many services is increasingly limited by availability rather than performance. A ke...
FCT
1997
Springer
13 years 9 months ago
1997
Springer
A connection management protocol establishes a connection between two hosts across a wide-area network to allow reliable message delivery. Following previous work of Kleinberg et a...