28 citations · 325 across the 73 of their papers we have counts for
6 papers · 1 filter
Universal Streaming of Subset Norms
Vladimir Braverman, Robert Krauthgamer, Lin F. Yang
Most known algorithms in the streaming model of computation aim to approximate a single function such as an -norm. In 2009, Nelson [\url{https://sublinear.info}, Open Probl…
DreamNLP: Novel NLP System for Clinical Report Metadata Extraction using Count Sketch Data Streaming Algorithm: Preliminary Results
Sanghyun Choi, Nikita Ivkin, Vladimir Braverman +1
Extracting information from electronic health records (EHR) is a challenging task since it requires prior knowledge of the reports and some natural language processing algorithm (N…
Approximations of Schatten Norms via Taylor Expansions
Vladimir Braverman
In this paper we consider symmetric, positive semidefinite (SPSD) matrix and present two algorithms for computing the -Schatten norm . The first algorithm works for…
Near Optimal Linear Algebra in the Online and Sliding Window Models
Vladimir Braverman, Petros Drineas, Cameron Musco +4
We initiate the study of numerical linear algebra in the sliding window model, where only the most recent updates in a stream form the underlying data set. We first introduce a…
Nearly Optimal Distinct Elements and Heavy Hitters on Sliding Windows
Vladimir Braverman, Elena Grigorescu, Harry Lang +2
We study the distinct elements and -heavy hitters problems in the sliding window model, where only the most recent elements in the data stream form the underlying set.…
Revisiting Frequency Moment Estimation in Random Order Streams
Vladimir Braverman, Emanuele Viola, David Woodruff +1
We revisit one of the classic problems in the data stream literature, namely, that of estimating the frequency moments for of an underlying -dimensional vector…