default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark A. Iwen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j21]Mark A. Iwen, Benjamin Schmidt, Arman Tavakoli
:
On Fast Johnson-Lindenstrauss Embeddings of Compact Submanifolds of $\mathbbm {R}^N$ with Boundary. Discret. Comput. Geom. 71(2): 498-555 (2024)- [j20]Santhosh Karnik, Rongrong Wang, Mark A. Iwen:
Neural network approximation of continuous functions in high dimensions with applications to inverse problems. J. Comput. Appl. Math. 438: 115557 (2024) - 2021
- [j19]Craig Gross, Mark A. Iwen, Lutz Kämmerer, Toni Volkmer:
A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size. Adv. Comput. Math. 47(6): 86 (2021) - [j18]Mark A. Iwen, Felix Krahmer, Sara Krause-Solberg, Johannes Maly:
On Recovery Guarantees for One-Bit Compressed Sensing on Manifolds. Discret. Comput. Geom. 65(4): 953-998 (2021) - [j17]Bosu Choi, Mark A. Iwen, Felix Krahmer:
Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables. Found. Comput. Math. 21(2): 275-329 (2021) - [j16]Bosu Choi, Mark A. Iwen, Toni Volkmer:
Sparse harmonic transforms II: best s-term approximation guarantees for bounded orthonormal product bases in sublinear-time. Numerische Mathematik 148(2): 293-362 (2021) - [j15]Mark A. Iwen, Deanna Needell, Elizaveta Rebrova, Ali Zare:
Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares. SIAM J. Matrix Anal. Appl. 42(1): 376-416 (2021) - 2020
- [j14]Nada Sissouno, Florian Boßmann, Frank Filbir, Mark A. Iwen, Maik Kahnt, Rayan Saab, Christian Schroer, Wolfgang zu Castell:
A direct solver for the phase retrieval problem in ptychographic imaging. Math. Comput. Simul. 176: 292-300 (2020) - 2019
- [j13]Sina Bittens, Ruochuan Zhang, Mark A. Iwen:
A deterministic sparse FFT for functions with structured Fourier sparsity. Adv. Comput. Math. 45(2): 519-561 (2019) - 2018
- [j12]Ali Zare, Alp Ozdemir, Mark A. Iwen, Selin Aviyente:
Extension of PCA to Higher Order Data Structures: An Introduction to Tensors, Tensor Decompositions, and Tensor PCA. Proc. IEEE 106(8): 1341-1358 (2018) - 2017
- [j11]Xianfeng Hu, Mark A. Iwen, Hyejin Kim:
Rapidly computing sparse Legendre expansions via sparse Fourier transforms. Numer. Algorithms 74(4): 1029-1059 (2017) - 2016
- [j10]Mark A. Iwen, Aditya Viswanathan, Yang Wang:
Fast Phase Retrieval from Local Correlation Measurements. SIAM J. Imaging Sci. 9(4): 1655-1688 (2016) - [j9]Mark A. Iwen, B. W. Ong:
A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks. SIAM J. Matrix Anal. Appl. 37(4): 1699-1718 (2016) - 2014
- [j8]Mark A. Iwen:
Compressed sensing with sparse binary matrices: Instance optimal error guarantees in near-optimal time. J. Complex. 30(1): 1-15 (2014) - [j7]Anna C. Gilbert, Piotr Indyk, Mark A. Iwen, Ludwig Schmidt:
Recent Developments in the Sparse Fourier Transform: A compressed Fourier transform for big data. IEEE Signal Process. Mag. 31(5): 91-100 (2014) - 2013
- [j6]Ben Segal, Mark A. Iwen:
Improved sparse fourier approximation results: faster implementations and stronger guarantees. Numer. Algorithms 63(2): 239-263 (2013) - [j5]Mark A. Iwen, Fadil Santosa, Rachel A. Ward:
A Symbol-Based Algorithm for Decoding Bar Codes. SIAM J. Imaging Sci. 6(1): 56-77 (2013) - 2012
- [j4]James P. Bailey, Mark A. Iwen, Craig V. Spencer:
On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions. SIAM J. Matrix Anal. Appl. 33(1): 263-289 (2012) - [j3]Mark A. Iwen, Ahmed H. Tewfik:
Adaptive Strategies for Target Detection and Localization in Noisy Environments. IEEE Trans. Signal Process. 60(5): 2344-2353 (2012) - 2010
- [j2]Mark A. Iwen:
Combinatorial Sublinear-Time Fourier Algorithms. Found. Comput. Math. 10(3): 303-338 (2010) - 2009
- [j1]Mark A. Iwen, Craig V. Spencer:
A note on compressed sensing and the complexity of matrix multiplication. Inf. Process. Lett. 109(10): 468-471 (2009)
Conference and Workshop Papers
- 2021
- [c20]Michael Perlmutter, Jieqian He, Mark A. Iwen, Matthew J. Hirn:
A Hybrid Scattering Transform for Signals with Isolated Singularities. ACSCC 2021: 1322-1329 - 2020
- [c19]Michael Perlmutter, Nada Sissouno, Aditya Viswanathan, Mark A. Iwen:
A Provably Accurate Algorithm for Recovering Compactly Supported Smooth Functions from Spectrogram Measurements. EUSIPCO 2020: 970-974 - 2017
- [c18]Alp Ozdemir, Marisel Villafane-Delgado, David C. Zhu, Mark A. Iwen, Selin Aviyente:
Multi-scale higher order singular value decomposition (MS-HoSVD) for resting-state FMRI compression and analysis. ICASSP 2017: 6299-6303 - 2016
- [c17]Alp Ozdemir, Mark A. Iwen, Selin Aviyente:
Multiscale tensor decomposition. ACSSC 2016: 625-629 - [c16]Alp Ozdemir, Mark A. Iwen, Selin Aviyente:
A multiscale approach for tensor denoising. SSP 2016: 1-5 - 2015
- [c15]Aditya Viswanathan, Mark A. Iwen:
Fast compressive phase retrieval. ACSSC 2015: 1686-1690 - [c14]Alp Ozdemir, Mark A. Iwen, Selin Aviyente:
Locally linear low-rank tensor approximation. GlobalSIP 2015: 839-843 - 2012
- [c13]Guangliang Chen, Mark A. Iwen, Sang Chin, Mauro Maggioni:
A fast multiscale framework for data in high-dimensions: Measure estimation, anomaly detection, and compressive measurements. VCIP 2012: 1-6 - 2011
- [c12]Mark A. Iwen, Ahmed H. Tewfik:
Adaptive compressed sensing for sparse signals in noise. ACSCC 2011: 1240-1244 - 2009
- [c11]Mark A. Iwen:
Simple deterministically constructible RIP matrices with sublinear fourier sampling requirements. CISS 2009: 870-875 - [c10]Mark A. Iwen:
Empirical evaluation of two Deterministic Sparse Fourier Transforms. CISS 2009: 893-896 - 2008
- [c9]Anna C. Gilbert, Mark A. Iwen, Martin J. Strauss:
Group testing and sparse signal recovery. ACSCC 2008: 1059-1063 - [c8]Mark A. Iwen, Craig V. Spencer:
Improved bounds for a deterministic sublinear-time Sparse Fourier Algorithm. CISS 2008: 458-463 - [c7]Mark A. Iwen, Willis Lang, Jignesh M. Patel:
Scalable Rule-Based Gene Expression Data Classification. ICDE 2008: 1062-1071 - [c6]Mark A. Iwen:
A deterministic sub-linear time sparse fourier algorithm via non-adaptive compressed sensing methods. SODA 2008: 20-29 - 2007
- [c5]Mark A. Iwen, Gurjit S. Mandair, Michael D. Morris, Martin Strauss:
Fast Line-Based Imaging of Small Sample Features. ICASSP (1) 2007: 421-424 - 2002
- [c4]Mark A. Iwen, Amol Dattatraya Mali:
Interaction graphs for planning problem decomposition. AAMAS 2002: 984-985 - [c3]Mark A. Iwen, Amol Dattatraya Mali:
Automatic Problem Decomposition for Distributed Planning. IC-AI 2002: 411-417 - [c2]Mark A. Iwen, Amol Dattatraya Mali:
Distributed Graphplan. ICTAI 2002: 138-145 - [c1]Mark A. Iwen, Amol Dattatraya Mali:
DSatz: A Directional SAT Solver for Planning. ICTAI 2002: 199-208
Informal and Other Publications
- 2024
- [i35]Rafael Chiclana, Mark A. Iwen, Mark Philip Roach:
On Outer Bi-Lipschitz Extensions of Linear Johnson-Lindenstrauss Embeddings of Subsets of RN. CoRR abs/2403.03969 (2024) - [i34]Cullen Haselby, Mark A. Iwen, Santhosh Karnik, Rongrong Wang:
Tensor Deli: Tensor Completion for Low CP-Rank Tensors via Random Sampling. CoRR abs/2403.09932 (2024) - 2023
- [i33]Craig Gross, Mark A. Iwen:
Sparse Spectral Methods for Solving High-Dimensional and Multiscale Elliptic PDEs. CoRR abs/2302.00752 (2023) - [i32]Cullen Haselby, Santhosh Karnik, Mark A. Iwen:
Tensor Sandwich: Tensor Completion for Low CP-Rank Tensors via Adaptive Random Sampling. CoRR abs/2307.01297 (2023) - [i31]Cullen Haselby, Mark A. Iwen, Deanna Needell, Elizaveta Rebrova, William Swartworth:
Fast and Low-Memory Compressive Sensing Algorithms for Low Tucker-Rank Tensor Approximation from Streamed Measurements. CoRR abs/2308.13709 (2023) - 2022
- [i30]Mark A. Iwen, Mark Philip Roach:
On Outer Bi-Lipschitz Extensions of Linear Johnson-Lindenstrauss Embeddings of Low-Dimensional Submanifolds of RN. CoRR abs/2206.03376 (2022) - [i29]Santhosh Karnik, Rongrong Wang, Mark A. Iwen:
Neural Network Approximation of Lipschitz Functions in High Dimensions with Applications to Inverse Problems. CoRR abs/2208.13305 (2022) - 2021
- [i28]Theodore Faust, Mark A. Iwen, Rayan Saab, Rongrong Wang:
On the $\ell^\infty$-norms of the Singular Vectors of Arbitrary Powers of a Difference Matrix with Applications to Sigma-Delta Quantization. CoRR abs/2103.13419 (2021) - [i27]Mark A. Iwen, Arman Tavakoli, Benjamin Schmidt:
Lower Bounds on the Low-Distortion Embedding Dimension of Submanifolds of Rn. CoRR abs/2105.13512 (2021) - [i26]Mark A. Iwen, Michael Perlmutter, Nada Sissouno, Aditya Viswanathan:
Phase Retrieval for L2([-π, π]) via the Provably Accurate and Noise Robust Numerical Inversion of Spectrogram Measurements. CoRR abs/2106.02517 (2021) - [i25]Mark A. Iwen, Deanna Needell, Michael Perlmutter, Elizaveta Rebrova:
Modewise Operators, the Tensor Restricted Isometry Property, and Low-Rank Tensor Recovery. CoRR abs/2109.10454 (2021) - [i24]Mark A. Iwen, Benjamin Schmidt, Arman Tavakoli:
On Fast Johnson-Lindenstrauss Embeddings of Compact Submanifolds of RN with Boundary. CoRR abs/2110.04193 (2021) - [i23]Michael Perlmutter, Jieqian He, Mark A. Iwen, Matthew J. Hirn:
A Hybrid Scattering Transform for Signals with Isolated Singularities. CoRR abs/2110.04910 (2021) - [i22]Mark A. Iwen, Michael Perlmutter, Mark Philip Roach:
Toward Fast and Provably Accurate Near-field Ptychographic Phase Retrieval. CoRR abs/2112.10804 (2021) - 2020
- [i21]Craig Gross, Mark A. Iwen, Lutz Kämmerer, Toni Volkmer:
A Deterministic Algorithm for Constructing Multiple Rank-1 Lattices of Near-Optimal Size. CoRR abs/2003.09753 (2020) - [i20]Craig Gross, Mark A. Iwen, Lutz Kämmerer, Toni Volkmer:
Sparse Fourier Transforms on Rank-1 Lattices for the Rapid and Low-Memory Approximation of Functions of Many Variables. CoRR abs/2012.09889 (2020) - 2019
- [i19]Mark A. Iwen, Eric Lybrand, Aaron A. Nelson, Rayan Saab:
New Algorithms and Improved Guarantees for One-Bit Compressed Sensing on Manifolds. CoRR abs/1902.03726 (2019) - [i18]Michael Perlmutter, Sami Merhi, Aditya Viswanathan, Mark A. Iwen:
Inverting Spectrogram Measurements via Aliased Wigner Distribution Deconvolution and Angular Synchronization. CoRR abs/1907.10773 (2019) - [i17]Bosu Choi, Mark A. Iwen, Toni Volkmer:
Sparse Harmonic Transforms II: Best s-Term Approximation Guarantees for Bounded Orthonormal Product Bases in Sublinear-Time. CoRR abs/1909.09564 (2019) - [i16]Mark A. Iwen, Deanna Needell, Elizaveta Rebrova, Ali Zare:
Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares. CoRR abs/1912.08294 (2019) - 2018
- [i15]Mark A. Iwen, Felix Krahmer, Sara Krause-Solberg, Johannes Maly:
On Recovery Guarantees for One-Bit Compressed Sensing on Manifolds. CoRR abs/1807.06490 (2018) - 2017
- [i14]Alp Ozdemir, Mark A. Iwen, Selin Aviyente:
Multiscale Analysis for Higher-order Tensors. CoRR abs/1704.08578 (2017) - [i13]Sina Bittens, Ruochuan Zhang, Mark A. Iwen:
A Deterministic Sparse FFT for Functions with Structured Fourier Sparsity. CoRR abs/1705.05256 (2017) - 2016
- [i12]Mark A. Iwen, B. W. Ong:
A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks. CoRR abs/1601.07010 (2016) - [i11]Jade Larriva-Latt, Angela Morrison, Alison Radgowski, Joseph Tobin, Aditya Viswanathan, Mark A. Iwen:
Technical Report: Improved Fourier Reconstruction using Jump Information with Applications to MRI. CoRR abs/1610.03764 (2016) - 2015
- [i10]Mark A. Iwen, Aditya Viswanathan, Yang Wang:
Fast Phase Retrieval for High-Dimensions. CoRR abs/1501.02377 (2015) - [i9]Xianfeng Hu, Mark A. Iwen, Hyejin Kim:
Rapidly Computing Sparse Legendre Expansions via Sparse Fourier Transforms. CoRR abs/1508.04758 (2015) - 2013
- [i8]Mark A. Iwen:
Compressed Sensing with Sparse Binary Matrices: Instance Optimal Error Guarantees in Near-Optimal Time. CoRR abs/1302.5936 (2013) - [i7]Mark A. Iwen, Rayan Saab:
Near-Optimal Encoding for Sigma-Delta Quantization of Finite Frame Expansions. CoRR abs/1307.2136 (2013) - [i6]Mark A. Iwen, Felix Krahmer:
Fast Subspace Approximation via Greedy Least-Squares. CoRR abs/1312.1413 (2013) - 2012
- [i5]Mark A. Iwen, Mauro Maggioni:
Approximation of Points on Low-Dimensional Manifolds Via Random Linear Projections. CoRR abs/1204.3337 (2012) - [i4]Mark A. Iwen, Fadil Santosa, Rachel A. Ward:
A symbol-based algorithm for decoding bar codes. CoRR abs/1210.7009 (2012) - 2011
- [i3]James P. Bailey, Mark A. Iwen, Craig V. Spencer:
On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions. CoRR abs/1105.6138 (2011) - 2010
- [i2]Mark A. Iwen:
Improved Approximation Guarantees for Sublinear-Time Fourier Algorithms. CoRR abs/1010.0014 (2010) - 2007
- [i1]Mark A. Iwen:
A Deterministic Sub-linear Time Sparse Fourier Algorithm via Non-adaptive Compressed Sensing Methods. CoRR abs/0708.1211 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
