ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2107.09091
  4. Cited By
Support Recovery in Universal One-bit Compressed Sensing

Support Recovery in Universal One-bit Compressed Sensing

19 July 2021
A. Mazumdar
S. Pal
    MQ
ArXivPDFHTML

Papers citing "Support Recovery in Universal One-bit Compressed Sensing"

7 / 7 papers shown
Title
Exact Recovery of Sparse Binary Vectors from Generalized Linear Measurements
Arya Mazumdar
Neha Sangwan
MQ
38
0
0
21 Feb 2025
On a Near-Optimal \& Efficient Algorithm for the Sparse Pooled Data
  Problem
On a Near-Optimal \& Efficient Algorithm for the Sparse Pooled Data Problem
Max Hahn-Klimroth
R. Hofstad
Noëla Müller
Connor Riddlesden
FedML
16
1
0
22 Dec 2023
Improved Support Recovery in Universal One-bit Compressed Sensing
Improved Support Recovery in Universal One-bit Compressed Sensing
Namiko Matsumoto
Arya Mazumdar
S. Pal
23
3
0
29 Oct 2022
Binary Iterative Hard Thresholding Converges with Optimal Number of
  Measurements for 1-Bit Compressed Sensing
Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing
Namiko Matsumoto
A. Mazumdar
MQ
36
10
0
07 Jul 2022
One-Bit Compressive Sensing: Can We Go Deep and Blind?
One-Bit Compressive Sensing: Can We Go Deep and Blind?
Yiming Zeng
Shahin Khobahi
M. Soltanalian
11
6
0
13 Mar 2022
Universal 1-Bit Compressive Sensing for Bounded Dynamic Range Signals
Universal 1-Bit Compressive Sensing for Bounded Dynamic Range Signals
Sidhant Bansal
Arnab Bhattacharyya
Anamay Chaturvedi
Jonathan Scarlett
32
2
0
22 Feb 2022
Near optimal efficient decoding from pooled data
Near optimal efficient decoding from pooled data
Max Hahn-Klimroth
Noëla Müller
19
11
0
09 Aug 2021
1