630 search results - page 31 / 126 » Hardness results for approximating the bandwidth |
79
Voted
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
ABSTRACT. We study functionally private approximations. An approximation function g is functionally private with respect to f if, for any input x, g(x) reveals no more information ...
88
Voted
ICML
2010
IEEE
15 years 1 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
91
Voted
TELETRAFFIC
2007
Springer
15 years 6 months ago
2007
Springer
We consider a single circuit-switched communication link, depicted by a Erlang multi-class loss queue, where a customer may vary its required bandwidth during its service. We obtai...
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
Given a set A of m agents and a set I of n items, where agent A ∈ A has utility uA,i for item i ∈ I, our goal is to allocate items to agents to maximize fairness. Specificall...
88
Voted
MOBICOM
2004
ACM
15 years 6 months ago
2004
ACM
—The traffic load of wireless LANs is often unevenly distributed among the access points (APs), which results in unfair bandwidth allocation among users. We argue that the load ...