323 citations
- Claremont Graduate UniversityUS16 papers
- Scripps CollegeUS10 papers
- Pomona CollegeUS9 papers
- Harvey Mudd CollegeUS7 papers
- Pitzer CollegeUS7 papers
- Georgia Institute of TechnologyUS4 papers
- Arizona State UniversityUS3 papers
- Jagiellonian UniversityPL3 papers
- Massachusetts Institute of TechnologyUS3 papers
- University of California, Los AngelesUS3 papers
- University of ConnecticutUS3 papers
- University of South FloridaUS3 papers
17 papers · 1 filter
Practical approximate projection schemes in greedy signal space methods
Chris Garnatz, Xiaoyi Gu, Alison Kingman +3
Compressive sensing (CS) is a new signal acquisition paradigm which shows that far fewer samples are required to reconstruct sparse signals than previously thought. Although most o…
Bikei Invariants and Gauss Diagrams for Virtual Knotted Surfaces
Sam Nelson, Patricia Rivera
Marked vertex diagrams provide a combinatorial way to represent knotted surfaces in ; including virtual crossings allows for a theory of virtual knotted surfaces and…
Permutation invariant lattices
Lenny Fukshansky, Stephan Ramon Garcia, Xun Sun
We say that a Euclidean lattice in is permutation invariant if its automorphism group has non-trivial intersection with the symmetric group , i.e., if the lattic…
Exponential decay of reconstruction error from binary measurements of sparse signals
Richard Baraniuk, Simon Foucart, Deanna Needell +2
Binary measurements arise naturally in a variety of statistical and engineering applications. They may be inherent to the problem---e.g., in determining the relationship between ge…
On Montel and Montel-Popoviciu theorems in several variables
A. G. Aksoy, J. M. Almira
We present an elementary proof of a general version of Montel's theorem in several variables which is based on the use of tensor product polynomial interpolation. We also prove a M…
Linear Convergence of Stochastic Iterative Greedy Algorithms with Sparse Constraints
Nam Nguyen, Deanna Needell, Tina Woolf
Motivated by recent work on stochastic gradient descent methods, we develop two stochastic variants of greedy algorithms for possibly non-convex optimization problems with sparsity…