14 citations · 20 across the 13 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017
On the Complexity of Sampling Nodes Uniformly from a Graph
Flavio Chierichetti, Shahrzad Haddadan
We study a number of graph exploration problems in the following natural scenario: an algorithm starts exploring an undirected graph from some seed node; the algorithm, for an arbi…
cs.DS2017★ 5 cited
Algorithms for Low Rank Approximation
Flavio Chierichetti, Sreenivas Gollapudi, Ravi Kumar +3
We consider the problem of approximating a given matrix by a low-rank matrix so as to minimize the entrywise -approximation error, for any ; the case is t…