#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2007

2018

- This year (2)
- Last 5 years (16)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Mark A. Iwen
- Foundations of Computational Mathematics
- 2010

We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how to deterministically… (More)

- Mark A. Iwen
- 2009 Conference Record of the Forty-Third…
- 2009

We consider the recovery of sparse signals, f ∈ ℝN, containing at most k ≪ N nonzero entries using linear measurements contaminated with i.i.d. Gaussian background noise. Given this measurement… (More)

A Deterministic Sub-linear Time Sparse Fourier Algorithm via Non-adaptive Compressed Sensing Methods

- Mark A. Iwen
- SODA
- 2008

We study the problem of estimating the best B term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N ≫ B. More precisely, we investigate how to deterministically… (More)

- Mark A. Iwen, Mauro Maggioni
- ArXiv
- 2012

This paper considers the approximate reconstruction of po ints, ~x ∈ RD, which are close to a given compact d-dimensional submanifold, M, of RD using a small number of linear measurements of ~x. In… (More)

This paper studies the problem of recovering a signal with a sparse representation in a given orthonormal basis using as few noisy observations as possible. As opposed to previous studies, this paper… (More)

- Mark A. Iwen, Craig V. Spencer
- 2008 42nd Annual Conference on Information…
- 2008

This paper improves on the best-known runtime and measurement bounds for a recently proposed Deterministic sublinear-time Sparse Fourier Transform algorithm (hereafter called DSFT). In (Iwen, 2008 ),… (More)

- J. Bailey, Mark A. Iwen, Craig V. Spencer
- SIAM J. Matrix Analysis Applications
- 2012

We present a general class of compressed sensing matrices which are then demonstrated to have associated sublinear-time sparse approximation algorithms. We then develop methods for constructing… (More)

- Mark A. Iwen, Ahmed H. Tewfik
- IEEE Transactions on Signal Processing
- 2012

This paper studies the problem of recovering a signal with a sparse representation in a given orthonormal basis using as few noisy observations as possible. Herein, observations are subject to the… (More)

- Mark A. Iwen, Willis Lang, Jignesh M. Patel
- 2008 IEEE 24th International Conference on Data…
- 2008

Current state-of-the-art association rule-based classifiers for gene expression data operate in two phases: (i) Association rule mining from training data followed by (ii) Classification of query… (More)

- Mark A. Iwen, Craig V. Spencer
- Inf. Process. Lett.
- 2009

We consider the conjectured O(N2+ ) time complexity of multiplying any two N × N matrices A and B. Our main result is a deterministic Compressed Sensing (CS) algorithm that both rapidly and… (More)