Sciweavers

112
Voted
APPROX
2015
Springer
24views Algorithms» more  APPROX 2015»
9 years 11 months ago
Approximating Hit Rate Curves using Streaming Algorithms
A hit rate curve is a function that maps cache size to the proportion of requests that can be served from the cache. (The caching policy and sequence of requests are assumed to be...
Zachary Drudi, Nicholas J. A. Harvey, Stephen Ingr...
APPROX
2015
Springer
21views Algorithms» more  APPROX 2015»
9 years 11 months ago
Decomposing Overcomplete 3rd Order Tensors using Sum-of-Squares Algorithms
Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank u...
Rong Ge, Tengyu Ma
127
Voted
APPROX
2015
Springer
32views Algorithms» more  APPROX 2015»
9 years 11 months ago
A Chasm Between Identity and Equivalence Testing with Conditional Queries
A recent model for property testing of probability distributions [CFGM13, CRS15] enables tremendous savings in the sample complexity of testing algorithms, by allowing them to con...
Jayadev Acharya, Clément L. Canonne, Gautam...
109
Voted
APPROX
2015
Springer
26views Algorithms» more  APPROX 2015»
9 years 11 months ago
Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree
Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad R...
APPROX
2015
Springer
23views Algorithms» more  APPROX 2015»
9 years 11 months ago
Tighter Connections between Derandomization and Circuit Lower Bounds
We tighten the connections between circuit lower bounds and derandomization for each of the following three types of derandomization: general derandomization of promise-BPP (conne...
Marco Carmosino, Russell Impagliazzo, Valentine Ka...