Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
APPROX
2015
Springer
24views Algorithms» more  APPROX 2015»
5 years 7 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»
5 years 7 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
APPROX
2015
Springer
32views Algorithms» more  APPROX 2015»
5 years 7 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...
APPROX
2015
Springer
26views Algorithms» more  APPROX 2015»
5 years 7 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»
5 years 7 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...
APPROX
2015
Springer
32views Algorithms» more  APPROX 2015»
5 years 7 months ago
Approximating Dense Max 2-CSPs
In this paper, we present a polynomial-time algorithm that approximates sufficiently high-value Max 2-CSPs on sufficiently dense graphs to within Nε approximation ratio for any c...
Pasin Manurangsi, Dana Moshkovitz
APPROX
2015
Springer
29views Algorithms» more  APPROX 2015»
5 years 7 months ago
Fully Dynamic Bin Packing Revisited
We consider the fully dynamic bin packing problem, where items arrive and depart in an online fashion and repacking of previously packed items is allowed. The goal is, of course, ...
Sebastian Berndt, Klaus Jansen, Kim-Manuel Klein
APPROX
2015
Springer
28views Algorithms» more  APPROX 2015»
5 years 7 months ago
Correlation in Hard Distributions in Communication Complexity
We study the effect that the amount of correlation in a bipartite distribution has on the communication complexity of a problem under that distribution. We introduce a new family...
Ralph Bottesch, Dmitry Gavinsky, Hartmut Klauck
APPROX
2015
Springer
35views Algorithms» more  APPROX 2015»
5 years 7 months ago
Average Distance Queries through Weighted Samples in Graphs and Metric Spaces: High Scalability with Tight Statistical Guarantee
The average distance from a node to all other nodes in a graph, or from a query point in a metric space to a set of points, is a fundamental quantity in data analysis. The inverse...
Shiri Chechik, Edith Cohen, Haim Kaplan
APPROX
2015
Springer
27views Algorithms» more  APPROX 2015»
5 years 7 months ago
Spectral Norm of Random Kernel Matrices with Applications to Privacy
Kernel methods are an extremely popular set of techniques used for many important machine learning and data analysis applications. In addition to having good practical performance...
Shiva Prasad Kasiviswanathan, Mark Rudelson
books