Sciweavers

4744 search results - page 866 / 949
» Connected Computing
Sort
View
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
15 years 4 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
CHI
2010
ACM
15 years 4 months ago
MOSES: exploring new ground in media and post-conflict reconciliation
While the history of traditional media in post-conflict peace building efforts is rich and well studied, the potential for interactive new media technologies in this area has gone...
Thomas N. Smyth, John Etherton, Michael L. Best
SPAA
2010
ACM
15 years 4 months ago
Online capacity maximization in wireless networks
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
Alexander Fanghänel, Sascha Geulen, Martin Ho...
EDCC
2010
Springer
15 years 4 months ago
D2HT: The Best of Both Worlds, Integrating RPS and DHT
Distributed Hash Tables (DHTs) and Random Peer Sampling (RPS) provide important and complementary services in the area of P2P overlay networks. DHTs achieve efficient lookup whil...
Marin Bertier, François Bonnet, Anne-Marie ...
ICA3PP
2009
Springer
15 years 4 months ago
Evaluating a Dependable Sharable Atomic Data Service on a Planetary-Scale Network
Abstract. Practical implementations of atomically consistent read/write memory service are important building blocks for higher level applications. This is especially true when dat...
Chryssis Georgiou, Nikolas Hadjiprocopiou, Peter M...