Sciweavers

630 search results - page 49 / 126
» Hardness results for approximating the bandwidth
Sort
View
99
Voted
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
16 years 26 days ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
102
Voted
EUROSYS
2007
ACM
15 years 9 months ago
Latency and bandwidth-minimizing failure detectors
Failure detectors are fundamental building blocks in distributed systems. Multi-node failure detectors, where the detector is tasked with monitoring N other nodes, play a critical...
Kelvin C. W. So, Emin Gün Sirer
IEEEPACT
2006
IEEE
15 years 6 months ago
Compiling for stream processing
This paper describes a compiler for stream programs that efficiently schedules computational kernels and stream memory operations, and allocates on-chip storage. Our compiler uses...
Abhishek Das, William J. Dally, Peter R. Mattson
ECCC
2007
147views more  ECCC 2007»
15 years 10 days ago
Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
In the undirected Edge-Disjoint Paths problem with Congestion (EDPwC), we are given an undirected graph with V nodes, a set of terminal pairs and an integer c. The objective is to...
Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswa...
VLDB
1997
ACM
99views Database» more  VLDB 1997»
15 years 4 months ago
Resource Scheduling in Enhanced Pay-Per-View Continuous Media Databases
The enhanced pay-per-view (EPPV) model for providing continuous-media-on-demand(CMOD) services associates with each continuous media clip a display frequency that dependson the cl...
Minos N. Garofalakis, Banu Özden, Abraham Sil...