33 citations · 84 across the 22 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019
Improved Local Computation Algorithm for Set Cover via Sparsification
Christoph Grunau, Slobodan Mitrović, Ronitt Rubinfeld +1
We design a Local Computation Algorithm (LCA) for the set cover problem. Given a set system where each set has size at most and each element is contained in at most sets, t…
cs.LG2019★ 19 cited
Learning-Based Low-Rank Approximations
Piotr Indyk, Ali Vakilian, Yang Yuan
We introduce a "learning-based" algorithm for the low-rank decomposition problem: given an matrix , and a parameter , compute a rank- matrix that minimiz…
cs.DS2019★ 17 cited
(Learned) Frequency Estimation Algorithms under Zipfian Distribution
Anders Aamand, Piotr Indyk, Ali Vakilian
\begin{abstract} The frequencies of the elements in a data stream are an important statistical measure and the task of estimating them arises in many applications within data analy…