3 citations · 3 across the 4 of their papers we have counts for
Showing 2015 · cs.DSShow all
2 papers · 2 filters
cs.DS2015
Approximating Subadditive Hadamard Functions on Implicit Matrices
Vladimir Braverman, Alan Roytman, Gregory Vorsanger
An important challenge in the streaming model is to maintain small-space approximations of entrywise functions performed on a matrix that is generated by the outer product of two v…
cs.DS2015
A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret
Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett +4
We consider algorithms for "smoothed online convex optimization" problems, a variant of the class of online convex optimization problems that is strongly related to metrical task s…