10493 search results - page 1735 / 2099 » Dynamic Word Problems |
117
Voted
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...
169
click to vote
COMPGEOM
2010
ACM
15 years 8 months ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
129
Voted
ICNP
2002
IEEE
15 years 8 months ago
2002
IEEE
We advocate the notion of service overlay network (SON) as an effective means to address some of the issues, in particular, end-to-end QoS, plaguing the current Internet, and to f...
140
click to vote
FUN
2010
Springer
15 years 8 months ago
2010
Springer
In countries such as China or Iran where Internet censorship is prevalent, users usually rely on proxies or anonymizers to freely access the web. The obvious difficulty with this a...
133
Voted
HPDC
2000
IEEE
15 years 7 months ago
2000
IEEE
In this paper, we present a performance evaluation of a wide-area cluster system based on a rewallenabled Globus metacomputing toolkit. In order to establish communication links ...