#### Filter Results:

#### Publication Year

1998

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

This paper considers the classical error correcting problem which is frequently discussed in coding theory. We wish to recover an input vector f ∈ R n from corrupted measurements y = Af + e. Here, A is an m by n (coding) matrix and e is an arbitrary and unknown vector of errors. Is it possible to recover f exactly from the data y? We prove that under… (More)

This paper considers the model problem of reconstructing an object from incomplete frequency samples. Consider a discrete-time signal f ∈ C N and a randomly chosen set of frequencies Ω. Is it possible to reconstruct f from the partial knowledge of its Fourier coefficients on the set Ω? A typical result of this paper is as follows. Suppose that f is a… (More)

Suppose we wish to recover a vector x 0 ∈ R m (e.g. a digital signal or image) from incomplete and contaminated observations y = Ax 0 + e; A is a n by m matrix with far fewer rows than columns (n m) and e is an error term. Is it possible to recover x 0 accurately based on the data y? To recover x 0 , we consider the solution x to the 1-regularization… (More)

- Terence Tao
- 2005

In many important statistical applications, the number of variables or parameters p is much larger than the number of observations n. Suppose then that we have observations y = Ax + z, where x ∈ R p is a parameter vector of interest, A is a data matrix with possibly far fewer rows than columns, n p, and the z i 's are i.i.d. N (0, σ 2). Is it possible to… (More)

—Suppose we are given a vector f in a class F N , e.g., a class of digital signals or digital images. How many linear measurements do we need to make about f to be able to recover f to within precision in the Euclidean (` 2) metric? This paper shows that if the objects of interest are sparse in a fixed basis or compressible, then it is possible to… (More)

- Markus Keel, Terence Tao
- 2007

We prove an abstract Strichartz estimate, which implies previously unknown endpoint Strichartz estimates for the wave equation (in dimension n 4) and the Schrr odinger equation (in dimension n 3). Three other applications are discussed: local existence for a nonlinear wave equation; and Strichartz-type estimates for more general dispersive equations and for… (More)

This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a great number of applications, including the famous Netflix Prize and other similar questions in collaborative filtering. In general, accurate recovery of a matrix from a small number… (More)

- Terence Tao
- 2007

- Terence Tao
- 2008

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemerédi's theorem, which asserts that any subset of the integers of positive density contains progressions of arbitrary length. The second, which is the main new ingredient of this paper, is a certain transference principle. This… (More)

- Terence Tao
- 2011