Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SODA
2016
ACM
57views Algorithms» more  SODA 2016»
5 years 7 months ago
On the maximum quartet distance between phylogenetic trees
A conjecture of Bandelt and Dress states that the maximum quartet distance between any two phylogenetic trees on n leaves is at most (2 3 + o(1)) n 4 . Using the machinery of fla...
Noga Alon, Humberto Naves, Benny Sudakov
SODA
2016
ACM
62views Algorithms» more  SODA 2016»
5 years 7 months ago
Clustering Problems on Sliding Windows
We explore clustering problems in the streaming sliding window model in both general metric spaces and Euclidean space. We present the first polylogarithmic space O(1)-approximat...
Vladimir Braverman, Harry Lang, Keith Levin, Morte...
SODA
2016
ACM
59views Algorithms» more  SODA 2016»
5 years 7 months ago
The Restricted Isometry Property of Subsampled Fourier Matrices
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...
Ishay Haviv, Oded Regev
SODA
2016
ACM
49views Algorithms» more  SODA 2016»
5 years 7 months ago
Simple Pricing Schemes For Consumers With Evolving Values
Shuchi Chawla, Nikhil R. Devanur, Anna R. Karlin, ...
SODA
2016
ACM
52views Algorithms» more  SODA 2016»
5 years 7 months ago
The Adversarial Noise Threshold for Distributed Protocols
We consider the problem of implementing distributed protocols, despite adversarial channel errors, on synchronous-messaging networks with arbitrary topology. In our first result ...
William M. Hoza, Leonard J. Schulman
SODA
2016
ACM
51views Algorithms» more  SODA 2016»
5 years 7 months ago
Communication with Contextual Uncertainty
Badih Ghazi, Ilan Komargodski, Pravesh Kothari, Ma...
SODA
2016
ACM
62views Algorithms» more  SODA 2016»
5 years 7 months ago
Communication Complexity of Permutation-Invariant Functions
Badih Ghazi, Pritish Kamath, Madhu Sudan
SODA
2016
ACM
57views Algorithms» more  SODA 2016»
5 years 7 months ago
Towards Optimal Deterministic Coding for Interactive Communication
We study efficient, deterministic interactive coding schemes that simulate any interactive protocol both under random and adversarial errors, and can achieve a constant communicat...
Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ro...
SODA
2016
ACM
60views Algorithms» more  SODA 2016»
5 years 7 months ago
Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover
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...
Amit Chakrabarti, Anthony Wirth
SODA
2016
ACM
97views Algorithms» more  SODA 2016»
5 years 7 months ago
Bounds for Random Constraint Satisfaction Problems via Spatial Coupling
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...
Dimitris Achlioptas, Seyed Hamed Hassani, Nicolas ...
books