82 citations · 160 across the 13 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2019
Sparse Recovery for Orthogonal Polynomial Transforms
Anna Gilbert, Albert Gu, Christopher Re +2
In this paper we consider the following sparse recovery problem. We have query access to a vector $\vx \in \R^N$ such that $\vhx = \vF \vx$ is -sparse (or nearly -sparse) for…
cs.DS2017
Implementation of Tetris as a Model Counter
Jimmy Dobler, Atri Rudra
Solving SharpSAT problems is an important area of work. In this paper, we discuss implementing Tetris, an algorithm originally designed for handling natural joins, as an exact mode…
cs.DS2013★ 24 cited
L2/L2-foreach sparse recovery with low risk
Anna C. Gilbert, Hung Q. Ngo, Ely Porat +2
In this paper, we consider the "foreach" sparse recovery problem with failure probability . The goal of which is to design a distribution over matrices and a de…