Sciweavers

2924 search results - page 429 / 585
» Lower Bounds in Distributed Computing
Sort
View
IPPS
2005
IEEE
15 years 10 months ago
A Powerful Direct Mechanism for Optimal WWW Content Replication
This paper addresses the problem of fine-grained data replication in large distributed systems, such as the Internet, so as to minimize the user access delays. With fine-grained d...
Samee Ullah Khan, Ishfaq Ahmad
PVLDB
2010
134views more  PVLDB 2010»
15 years 3 months ago
Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
Thanh T. L. Tran, Andrew McGregor, Yanlei Diao, Li...
DEBS
2003
ACM
15 years 10 months ago
A peer-to-peer approach to content-based publish/subscribe
Publish/subscribe systems are successfully used to decouple distributed applications. However, their efficiency is closely tied to the topology of the underlying network, the desi...
Wesley W. Terpstra, Stefan Behnel, Ludger Fiege, A...
AAAI
2007
15 years 7 months ago
Restart Schedules for Ensembles of Problem Instances
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
PODC
2006
ACM
15 years 10 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...