Sciweavers

909 search results - page 73 / 182
» On the approximability of some network design problems
Sort
View
INFOCOM
2000
IEEE
15 years 10 months ago
Alternate Path Routing for Multicast
Abstract— Alternate path routing has been well-explored in telecommunication networks as a means of decreasing the call blocking rate and increasing network utility. However, asi...
Daniel Zappala
NCA
2009
IEEE
16 years 28 days ago
A Distributed Algorithm for Web Content Replication
—Web caching and replication techniques increase accessibility of Web contents and reduce Internet bandwidth requirements. In this paper, we are considering the replica placement...
Sharrukh Zaman, Daniel Grosu
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 6 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
STOC
2004
ACM
110views Algorithms» more  STOC 2004»
16 years 6 months ago
On sums of independent random variables with unbounded variance, and estimating the average degree in a graph
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
Uriel Feige
ICPADS
2002
IEEE
15 years 11 months ago
Experiences in Building a Scalable Distributed Network Emulation System
Network emulation systems are widely used to explore the behavior of network protocols and to test and evaluate protocol implementations and applications. The major problem of net...
Pei Zheng, Lionel M. Ni