Sublinear-time algorithms for compressive phase retrieval
In the compressive phase retrieval problem, the goal is to reconstruct a sparse or approximately k-sparse vector x ∈ R n given access to y = |Φ x |, where |v| denotes the vector obtained from taking the absolute value of v ∈ R n coordinatewise. In this paper we present sublinear-time algorithms for...
Saved in:
Main Authors: | Li, Yi, Nakos, Vasileios |
---|---|
Other Authors: | School of Physical and Mathematical Sciences |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/142571 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Sublinear-time algorithms for compressive phase retrieval
by: Li, Yi, et al.
Published: (2022) -
Deterministic heavy hitters with sublinear query time
by: Li, Yi, et al.
Published: (2018) -
Sublinear Algorithms in T-interval Dynamic Networks
by: I. Jahja, et al.
Published: (2021) -
CHANNEL DETECTION AND DECODING ALGORITHMS
by: VINTU JOSE ALAPPAT
Published: (2018) -
Compressed dynamic tries with applications to LZ-compression in sublinear time and space
by: Jansson, J., et al.
Published: (2013)