The following pages link to Mark A. Iwen (Q1762318):
Displaying 34 items.
- (Q347520) (redirect page) (← links)
- Robust sparse phase retrieval made easy (Q347523) (← links)
- Near-optimal encoding for sigma-delta quantization of finite frame expansions (Q485203) (← links)
- Rapidly computing sparse Legendre expansions via sparse Fourier transforms (Q521921) (← links)
- (Q745853) (redirect page) (← links)
- Fast subspace approximation via greedy least-squares (Q745854) (← links)
- Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
- A note on compressed sensing and the complexity of matrix multiplication (Q987795) (← links)
- Improved approximation guarantees for sublinear-time Fourier algorithms (Q1762319) (← links)
- A direct solver for the phase retrieval problem in ptychographic imaging (Q1998068) (← links)
- A deterministic sparse FFT for functions with structured Fourier sparsity (Q2000485) (← links)
- On recovery guarantees for one-bit compressed sensing on manifolds (Q2022611) (← links)
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables (Q2031058) (← links)
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time (Q2038427) (← links)
- On the \(\ell^\infty\)-norms of the singular vectors of arbitrary powers of a difference matrix with applications to sigma-delta quantization (Q2040542) (← links)
- A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size (Q2070286) (← links)
- Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables (Q2073139) (← links)
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time (Q2252137) (← links)
- Phase retrieval from local measurements: improved robustness via eigenvector-based angular synchronization (Q2278466) (← links)
- Lower Lipschitz bounds for phase retrieval from locally supported measurements (Q2325548) (← links)
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
- A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees (Q2420230) (← links)
- Phase retrieval for \(L^2([-\pi, \pi])\) via the provably accurate and noise robust numerical inversion of spectrogram measurements (Q2686572) (← links)
- Toward fast and provably accurate near-field ptychographic phase retrieval (Q2700167) (← links)
- A Symbol-Based Algorithm for Decoding Bar Codes (Q2873188) (← links)
- Signal Approximation via the Gopher Fast Fourier Transform (Q3114152) (← links)
- Fast Phase Retrieval from Local Correlation Measurements (Q3179618) (← links)
- (Q3579463) (← links)
- Adaptive Strategies for Target Detection and Localization in Noisy Environments (Q4573685) (← links)
- Approximation of points on low-dimensional manifolds via random linear projections (Q4982420) (← links)
- Inverting spectrogram measurements via aliased Wigner distribution deconvolution and angular synchronization (Q5033280) (← links)
- Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares (Q5857850) (← links)
- Neural network approximation of continuous functions in high dimensions with applications to inverse problems (Q6056231) (← links)
- Modewise operators, the tensor restricted isometry property, and low-rank tensor recovery (Q6172173) (← links)
