5 citations · 19 across the 20 of their papers we have counts for
6 papers · 1 filter
Deterministic Heavy Hitters with Sublinear Query Time
Yi Li, Vasileios Nakos
This paper studies the classic problem of finding heavy hitters in the turnstile streaming model. We give the first deterministic linear sketch that has $O(ε^{-2} \log n \cdot \log…
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…
Predicting Positive and Negative Links with Noisy Queries: Theory & Practice
Charalampos E. Tsourakakis, Michael Mitzenmacher, Kasper Green Larsen +4
Social networks involve both positive and negative relationships, which can be captured in signed graphs. The {\em edge sign prediction problem} aims to predict whether an interact…
On Low-Risk Heavy Hitters and Sparse Recovery Schemes
Yi Li, Vasileios Nakos, David Woodruff
We study the heavy hitters and related sparse recovery problems in the low-failure probability regime. This regime is not well-understood, and has only been studied for non-adaptiv…
Sublinear-Time Algorithms for Compressive Phase Retrieval
Yi Li, Vasileios Nakos
In the compressive phase retrieval problem, or phaseless compressed sensing, or compressed sensing from intensity only measurements, the goal is to reconstruct a sparse or approxim…
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…