Sciweavers

611 search results - page 3 / 123
» A distributed algorithm for computing and updating the proce...
Sort
View
SIGMOD
2003
ACM
158views Database» more  SIGMOD 2003»
14 years 6 months ago
Processing Set Expressions over Continuous Update Streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
ICCTA
2007
IEEE
14 years 8 days ago
Partially Dynamic Concurrent Update of Distributed Shortest Paths
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
Gianlorenzo D'Angelo, Serafino Cicerone, Gabriele ...
NPC
2004
Springer
13 years 11 months ago
Request Distribution for Fairness with a New Load-Update Mechanism in Web Server Cluster
The complexity of services and applications provided by Web sites is ever increasing as integration of traditional Web publishing sites with new paradigms, i.e., e-commerce. Each d...
MinHwan Ok, Myong-Soon Park
ICDCSW
2002
IEEE
13 years 11 months ago
A Demand based Algorithm for Rapid Updating of Replicas
In many Internet scale replicated system, not all replicas can be dealt with in the same way, since some will be in greater demand than others. In the case of weak consistency algo...
Jesús Acosta-Elías, Leandro Navarro-...
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
13 years 11 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...