6 citations · 6 across the 2 of their papers we have counts for
4 papers · 1 filter
New and Explicit Constructions of Unbalanced Ramanujan Bipartite Graphs
Shantanu Prasad Burnwal, Kaneenika Sinha, Mathukumalli Vidyasagar
The objectives of this article are three-fold. Firstly, we present for the first time explicit constructions of an infinite family of \textit{unbalanced} Ramanujan bigraphs. Second…
Deterministic Completion of Rectangular Matrices Using Asymmetric Ramanujan Graphs: Exact and Stable Recovery
Shantanu Prasad Burnwal, Mathukumalli Vidyasagar
In this paper we study the matrix completion problem: Suppose is unknown except for a known upper bound on its rank. By measuring a small n…
Compressed Sensing Using Binary Matrices of Nearly Optimal Dimensions
Mahsa Lotfi, Mathukumalli Vidyasagar
In this paper, we study the problem of compressed sensing using binary measurement matrices and -norm minimization (basis pursuit) as the recovery algorithm. We derive new…
An Approach to One-Bit Compressed Sensing Based on Probably Approximately Correct Learning Theory
Mehmet Eren Ahsen, Mathukumalli Vidyasagar
In this paper, the problem of one-bit compressed sensing (OBCS) is formulated as a problem in probably approximately correct (PAC) learning. It is shown that the Vapnik-Chervonenki…