STOC
2007
ACM
14 years 11 months ago
2007
ACM
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
STOC
2007
ACM
14 years 11 months ago
2007
ACM
STOC
2007
ACM
14 years 11 months ago
2007
ACM
STOC
2007
ACM
14 years 11 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
STOC
2007
ACM
14 years 11 months ago
2007
ACM
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
STOC
2007
ACM
14 years 11 months ago
2007
ACM
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
STOC
2007
ACM
14 years 11 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
STOC
2007
ACM
14 years 11 months ago
2007
ACM
STOC
2007
ACM
14 years 11 months ago
2007
ACM
STOC
2007
ACM
14 years 11 months ago
2007
ACM
We give a randomized bi-criteria algorithm for the problem of finding a k-dimensional subspace that minimizes the Lp-error for given points, i.e., p-th root of the sum of p-th