358 search results - page 18 / 72 » Sparse squares of polynomials |
TSP
2010
13 years 3 months ago
2010
We consider the problem of recursively and causally reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of noisy...
313
click to vote
Lecture Notes
"These notes were originally prepared during Fall quarter 2003 for UCSD Math 174, Numerical Methods."
SIAMJO
2011
13 years 3 months ago
2011
Abstract. The condition number of a Gram matrix defined by a polynomial basis and a set of points is often used to measure the sensitivity of the least squares polynomial approxim...
IJCAI
2007
13 years 10 months ago
2007
We propose a novel approach to the problem of simultaneous localization and mapping (SLAM) based on incremental smoothing, that is suitable for real-time applications in large-sca...
FSTTCS
1992
Springer
14 years 1 months ago
1992
Springer
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic, randomized, and nondetermini...