activity
20182021
most citedOptimal Sketching for Kronecker Product Regression and Low Rank Approximation

17 citations · 24 across the 7 of their papers we have counts for

collaborators

14 papers

cs.DS2021

New Streaming Algorithms for High Dimensional EMD and MST

Xi Chen, Rajesh Jayaram, Amit Levi +1

We study streaming algorithms for two fundamental geometric problems: computing the cost of a Minimum Spanning Tree (MST) of an -point set , and com…

cs.DS2021

Truly Perfect Samplers for Data Streams and Sliding Windows

Rajesh Jayaram, David P. Woodruff, Samson Zhou

In the -sampling problem, the goal is to output an index of a vector , such that for all coordinates , \[\textbf{Pr}[i=j] = (1 \pm ε) \frac{G(f…

cs.DS20211 cited

In-Database Regression in Input Sparsity Time

Rajesh Jayaram, Alireza Samadian, David P. Woodruff +1

Sketching is a powerful dimensionality reduction technique for accelerating algorithms for data analysis. A crucial step in sketching methods is to compute a subspace embedding (SE…

cs.DS2021

An Optimal Algorithm for Triangle Counting in the Stream

Rajesh Jayaram, John Kallaugher

We present a new algorithm for approximating the number of triangles in a graph whose edges arrive as an arbitrary order stream. If is the number of edges in , the n…

cs.DS2020

When is Approximate Counting for Conjunctive Queries Tractable?

Marcelo Arenas, Luis Alberto Croquevielle, Rajesh Jayaram +1

Conjunctive queries are one of the most common class of queries used in database systems, and the best studied in the literature. A seminal result of Grohe, Schwentick, and Segoufi…

cs.DS2020

Testing Positive Semi-Definiteness via Random Submatrices

Ainesh Bakshi, Nadiia Chepurko, Rajesh Jayaram

We study the problem of testing whether a matrix with bounded entries () is positive semi-definite (PSD), or…