123
click to vote
SODA
2016
ACM
9 years 11 months ago
2016
ACM
A matrix A ∈ Cq×N satisfies the restricted isometry property of order k with constant ε if it preserves the 2 norm of all k-sparse vectors up to a factor of 1 ± ε. We prove...
112
click to vote
SODA
2016
ACM
9 years 11 months ago
2016
ACM
We consider the problem of implementing distributed protocols, despite adversarial channel errors, on synchronous-messaging networks with arbitrary topology. In our first result ...
110
Voted
SODA
2016
ACM
9 years 11 months ago
2016
ACM
100
click to vote
SODA
2016
ACM
9 years 11 months ago
2016
ACM
We study efficient, deterministic interactive coding schemes that simulate any interactive protocol both under random and adversarial errors, and can achieve a constant communicat...
113
click to vote
SODA
2016
ACM
9 years 11 months ago
2016
ACM
Set cover, over a universe of size n, may be modelled as a data-streaming problem, where the m sets that comprise the instance are to be read one by one. A semi-streaming algorith...
219
Voted
SODA
2016
ACM
9 years 11 months ago
2016
ACM
We report on a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial coupling was invented as an en...
114
click to vote
SODA
2016
ACM
9 years 11 months ago
2016
ACM
We initiate the study of trade-offs between sparsity and the number of measurements in sparse recovery schemes for generic norms. Specifically, for a norm · , sparsity paramete...
117
click to vote
SODA
2016
ACM
9 years 11 months ago
2016
ACM
We consider the Traveling Salesman Problem with Neighborhoods (TSPN) in doubling metrics. The goal is to find a shortest tour that visits each of a given collection of subsets (r...