18 search results - page 2 / 4 » focm 2010 |
FOCM
2010
13 years 2 months ago
2010
In [BP08], the average complexity of linear homotopy methods to solve polynomial equations with random initial input (in a sense to be described below) was proven to be finite, an...
FOCM
2010
13 years 3 months ago
2010
B-series are a fundamental tool in practical and theoretical aspects of numerical integrators for ordinary differential equations. A composition law for B-series permits an elega...
FOCM
2010
13 years 3 months ago
2010
We show how to approximate the feasible region of structured convex optimization problems by a family of convex sets with explicitly given and efficient (if the accuracy of the ap...
FOCM
2010
13 years 3 months ago
2010
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We...
FOCM
2010
13 years 3 months ago
2010
In compressed sensing we seek to gain information about vector x ∈ RN from d << N nonadaptive linear measurements. Candes, Donoho, Tao et. al. ( see e.g. [2, 4, 8]) propos...