358 search results - page 34 / 72 » Sparse squares of polynomials |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
JAT
2006
13 years 9 months ago
2006
We give a simple, geometric and explicit construction of bivariate interpolation at certain points in a square (called Padua points), giving compact formulas for their fundamental...
SIAMNUM
2010
13 years 3 months ago
2010
Hyperbolic cross approximations by some classical orthogonal polynomials/functions in both bounded and unbounded domains are considered in this paper. Optimal error estimates in pr...
COLT
2010
Springer
13 years 7 months ago
2010
Springer
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
STOC
2002
ACM
14 years 9 months ago
2002
ACM
d Abstract] A. C. Gilbert S. Guhay P. Indykz S. Muthukrishnan M. Strauss We give an algorithm for nding a Fourier representation R of B terms for a given discrete signal A of leng...