Sciweavers

630 search results - page 67 / 126
» Hardness results for approximating the bandwidth
Sort
View
226
Voted
SIGMOD
2009
ACM
250views Database» more  SIGMOD 2009»
16 years 25 days ago
Query processing techniques for solid state drives
Solid state drives perform random reads more than 100x faster than traditional magnetic hard disks, while offering comparable sequential read and write bandwidth. Because of their...
Dimitris Tsirogiannis, Stavros Harizopoulos, Mehul...
97
Voted
SOSP
2003
ACM
15 years 9 months ago
SplitStream: high-bandwidth multicast in cooperative environments
In tree-based multicast systems, a relatively small number of interior nodes carry the load of forwarding multicast messages. This works well when the interior nodes are highlyava...
Miguel Castro, Peter Druschel, Anne-Marie Kermarre...
103
Voted
INFOCOM
2003
IEEE
15 years 5 months ago
Algorithms for Computing QoS Paths with Restoration
— There is a growing interest among service providers to offer new services with Quality of Service (QoS) guaranties that are also resilient to failures. Supporting QoS connectio...
Yigal Bejerano, Yuri Breitbart, Rajeev Rastogi, Al...
95
Voted
CCR
2010
179views more  CCR 2010»
15 years 22 days ago
An argument for increasing TCP's initial congestion window
TCP flows start with an initial congestion window of at most four segments or approximately 4KB of data. Because most Web transactions are short-lived, the initial congestion wind...
Nandita Dukkipati, Tiziana Refice, Yuchung Cheng, ...
PODS
2009
ACM
100views Database» more  PODS 2009»
16 years 1 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...