☰

Mark A. Iwen, Ph.D. - Publications

Affiliations: 
2008 University of Michigan, Ann Arbor, Ann Arbor, MI 
Area:
Mathematics, Computer Science
Tree Info Similar researchers PubMed Report error

32 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2020 Sissouno N, Boßmann F, Filbir F, Iwen MA, Kahnt M, Saab R, Schroer C, Castell Wz. A direct solver for the phase retrieval problem in ptychographic imaging Mathematics and Computers in Simulation. 176: 292-300. DOI: 10.1016/J.Matcom.2019.11.003  0.343
2020 Iwen MA, Preskitt B, Saab R, Viswanathan A. Phase retrieval from local measurements: Improved robustness via eigenvector-based angular synchronization Applied and Computational Harmonic Analysis. 48: 415-444. DOI: 10.1016/J.Acha.2018.06.004  0.387
2020 Choi B, Iwen MA, Krahmer F. Sparse Harmonic Transforms: A New Class of Sublinear-time Algorithms for Learning Functions of Many Variables Foundations of Computational Mathematics. 1-55. DOI: 10.1007/S10208-020-09462-Z  0.403
2019 Iwen MA, Merhi S, Perlmutter M. Lower Lipschitz bounds for phase retrieval from locally supported measurements Applied and Computational Harmonic Analysis. 47: 526-538. DOI: 10.1016/J.Acha.2019.01.004  0.421
2019 Bittens S, Zhang R, Iwen MA. A deterministic sparse FFT for functions with structured Fourier sparsity Advances in Computational Mathematics. 45: 519-561. DOI: 10.1007/S10444-018-9626-4  0.417
2019 Merhi S, Zhang R, Iwen MA, Christlieb A. A New Class of Fully Discrete Sparse Fourier Transforms: Faster Stable Implementations with Guarantees Journal of Fourier Analysis and Applications. 25: 751-784. DOI: 10.1007/S00041-018-9616-4  0.4
2017 Hu X, Iwen M, Kim H. Rapidly computing sparse Legendre expansions via sparse Fourier transforms Numerical Algorithms. 74: 1029-1059. DOI: 10.1007/S11075-016-0184-X  0.432
2016 Iwen MA, Ong BW. A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks Siam Journal On Matrix Analysis and Applications. 37: 1699-1718. DOI: 10.1137/16M1058467  0.433
2016 Iwen MA, Viswanathan A, Wang Y. Fast Phase Retrieval from Local Correlation Measurements Siam Journal On Imaging Sciences. 9: 1655-1688. DOI: 10.1137/15M1053761  0.437
2015 Viswanathan A, Iwen M. Fast angular synchronization for phase retrieval via incomplete information Proceedings of Spie - the International Society For Optical Engineering. 9597. DOI: 10.1117/12.2186336  0.364
2015 Iwen M, Viswanathan A, Wang Y. Robust sparse phase retrieval made easy Applied and Computational Harmonic Analysis. DOI: 10.1016/J.Acha.2015.06.007  0.388
2015 Iwen MA, Krahmer F. Fast Subspace Approximation Via Greedy Least-Squares Constructive Approximation. 42: 281-301. DOI: 10.1007/S00365-014-9273-Z  0.402
2014 Gilbert AC, Indyk P, Iwen M, Schmidt L. Recent developments in the sparse fourier transform: A compressed fourier transform for big data Ieee Signal Processing Magazine. 31: 91-100. DOI: 10.1109/Msp.2014.2329131  0.368
2014 Iwen MA. Compressed sensing with sparse binary matrices: Instance optimal error guarantees in near-optimal time Journal of Complexity. 30: 1-15. DOI: 10.1016/J.Jco.2013.08.001  0.478
2013 Iwen MA, Santosa F, Ward R. A symbol-based algorithm for decoding bar codes Siam Journal On Imaging Sciences. 6: 56-77. DOI: 10.1137/110834378  0.395
2013 Iwen M, Saab R. Random encoding of quantized finite frame expansions Proceedings of Spie. 8858. DOI: 10.1117/12.2025293  0.338
2013 Iwen MA, Maggioni M. Approximation of points on low-dimensional manifolds via random linear projections Information and Inference. 2: 1-31. DOI: 10.1093/Imaiai/Iat001  0.372
2013 Iwen MA. Improved approximation guarantees for sublinear-time Fourier algorithms Applied and Computational Harmonic Analysis. 34: 57-82. DOI: 10.1016/J.Acha.2012.03.007  0.479
2013 Segal B, Iwen MA. Improved sparse fourier approximation results: Faster implementations and stronger guarantees Numerical Algorithms. 63: 239-263. DOI: 10.1007/S11075-012-9621-7  0.438
2013 Iwen MA, Saab R. Near-Optimal Encoding for Sigma-Delta Quantization of Finite Frame Expansions Journal of Fourier Analysis and Applications. 19: 1255-1273. DOI: 10.1007/S00041-013-9295-0  0.413
2012 Bailey J, Iwen MA, Spencer CV. On the design of deterministic matrices for fast recovery of fourier compressible functions Siam Journal On Matrix Analysis and Applications. 33: 263-289. DOI: 10.1137/110835864  0.432
2012 Iwen MA, Tewfik AH. Adaptive strategies for target detection and localization in noisy environments Ieee Transactions On Signal Processing. 60: 2344-2353. DOI: 10.1109/Tsp.2012.2187201  0.365
2010 Ben Segal I, Iwen MA. Signal approximation via the Gopher Fast Fourier Transform Aip Conference Proceedings. 1301: 494-502. DOI: 10.1063/1.3526650  0.334
2010 Iwen MA. Combinatorial sublinear-time Fourier algorithms Foundations of Computational Mathematics. 10: 303-338. DOI: 10.1007/S10208-009-9057-1  0.474
2009 Iwen MA. Empirical evaluation of two deterministic sparse fourier transforms Proceedings - 43rd Annual Conference On Information Sciences and Systems, Ciss 2009. 893-896. DOI: 10.1109/CISS.2009.5054843  0.337
2009 Iwen MA. Group testing strategies for recovery of sparse signals in noise Conference Record - Asilomar Conference On Signals, Systems and Computers. 1561-1565. DOI: 10.1109/ACSSC.2009.5470144  0.343
2009 Iwen MA, Spencer CV. A note on compressed sensing and the complexity of matrix multiplication Information Processing Letters. 109: 468-471. DOI: 10.1016/J.Ipl.2009.01.010  0.393
2008 Iwen MA, Spencer CV. Improved bounds for a Deterministic sublinear-time Sparse Fourier algorithm Ciss 2008, the 42nd Annual Conference On Information Sciences and Systems. 458-463. DOI: 10.1109/CISS.2008.4558570  0.345
2008 Gilbert AC, Iwen MA, Strauss MJ. Group testing and sparse signal recovery Conference Record - Asilomar Conference On Signals, Systems and Computers. 1059-1063. DOI: 10.1109/ACSSC.2008.5074574  0.387
2008 Iwen MA. A deterministic sub-linear time sparse fourier algorithm via non-adaptive Compressed Sensing Methods Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 20-29.  0.414
2007 Iwen MA, Gilbert A, Strauss M. Empirical evaluation of a sub-linear time sparse DFT algorithm Communications in Mathematical Sciences. 5: 981-998. DOI: 10.4310/Cms.2007.V5.N4.A13  0.518
2007 Iwen MA, Gilbert A, Strauss M. Empirical evaluation of a sub-linear time sparse DFT algorithm Communications in Mathematical Sciences. 5: 981-998.  0.414
Show low-probability matches.