5 citations · 19 across the 20 of their papers we have counts for
4 papers · 1 filter
Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time
Mahdi Cheraghchi, Vasileios Nakos
In the long-studied problem of combinatorial group testing, one is asked to detect a set of defective items out of a population of size , using disjunctive measure…
One-Bit ExpanderSketch for One-Bit Compressed Sensing
Vasileios Nakos
Is it possible to obliviously construct a set of hyperplanes H such that you can approximate a unit vector x when you are given the side on which the vector lies with respect to ev…
Almost Optimal Phaseless Compressed Sensing with Sublinear Decoding Time
Vasileios Nakos
In the problem of compressive phase retrieval, one wants to recover an approximately -sparse signal , given the magnitudes of the entries of , where $Φ\i…
On Fast Decoding of High Dimensional Signals from One-Bit Measurements
Vasileios Nakos
In the problem of one-bit compressed sensing, the goal is to find a -close estimation of a -sparse vector given the signs of the entries of , whe…