activity
20072026
most citedRecursive Sketching For Frequency Moments

28 citations · 325 across the 73 of their papers we have counts for

collaborators
Showing 2019Show all

12 papers · 1 filter

astro-ph.GA2019

Six Dimensional Streaming Algorithm for Cluster Finding in N-Body Simulations

Aidan Reilly, Nikita Ivkin, Gerard Lemson +2

Cosmological N-body simulations are crucial for understanding how the Universe evolves. Studying large-scale distributions of matter in these simulations and comparing them to obse…

cs.DS2019★ 4 cited

Memory-Efficient Performance Monitoring on Programmable Switches with Lean Algorithms

Zaoxing Liu, Samson Zhou, Ori Rottenstreich +2

Network performance problems are notoriously difficult to diagnose. Prior profiling systems collect performance statistics by keeping information about each network flow, but maint…

eess.IV2019★ 2 cited

Multiparametric Deep Learning Tissue Signatures for Muscular Dystrophy: Preliminary Results

Alex E. Bocchieri, Vishwa S. Parekh, Kathryn R. Wagner. Shivani Ahlawat +3

A current clinical challenge is identifying limb girdle muscular dystrophy 2I(LGMD2I)tissue changes in the thighs, in particular, separating fat, fat-infiltrated muscle, and muscle…

cs.DS2019★ 2 cited

Improved Algorithms for Time Decay Streams

Vladimir Braverman, Harry Lang, Enayat Ullah +1

In the time-decay model for data streams, elements of an underlying data set arrive sequentially with the recently arrived elements being more important. A common approach for hand…

cs.DS2019★ 5 cited

Schatten Norms in Matrix Streams: Hello Sparsity, Goodbye Dimension

Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan +1

Spectral functions of large matrices contains important structural information about the underlying data, and is thus becoming increasingly important. Many times, large matrices re…

cs.DS2019★ 7 cited

Coresets for Clustering in Graphs of Bounded Treewidth

Daniel Baker, Vladimir Braverman, Lingxiao Huang +3

We initiate the study of coresets for clustering in graph metrics, i.e., the shortest-path metric of edge-weighted graphs. Such clustering problems are essential to data analysis a…