Sciweavers

630 search results - page 23 / 126
» Hardness results for approximating the bandwidth
Sort
View
129
Voted
INFOCOM
2000
IEEE
15 years 4 months ago
A Predictability Analysis of Network Traffic
This paper assesses the predictability of network traffic by considering two metrics: (1) how far into the future a traffic rate process can be predicted with bounded error; (2) w...
Aimin Sang, San-qi Li
SIGARCH
2008
94views more  SIGARCH 2008»
15 years 12 days ago
Optimized on-chip pipelining of memory-intensive computations on the cell BE
Multiprocessors-on-chip, such as the Cell BE processor, regularly suffer from restricted bandwidth to off-chip main memory. We propose to reduce memory bandwidth requirements, and...
Christoph W. Kessler, Jörg Keller
FOCS
2000
IEEE
15 years 4 months ago
Fairness Measures for Resource Allocation
In many optimization problems, one seeks to allocate a limited set of resources to a set of individuals with demands. Thus, such allocations can naturally be viewed as vectors, wi...
Amit Kumar, Jon M. Kleinberg
97
Voted
TIT
2011
116views more  TIT 2011»
14 years 7 months ago
Approximate Characterizations for the Gaussian Source Broadcast Distortion Region
We consider the joint source-channel coding problem of sending a Gaussian source over a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achieva...
Chao Tian, Suhas N. Diggavi, Shlomo Shamai
ESA
2009
Springer
129views Algorithms» more  ESA 2009»
15 years 7 months ago
Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
Dániel Marx, Igor Razgon