Sciweavers

358 search results - page 33 / 72
» Sparse squares of polynomials
Sort
View
ICASSP
2011
IEEE
13 years 21 days ago
Revisiting adaptive least-squares estimation and application to online sparse signal recovery
This paper presents a novel time-adaptive estimation technique by revisiting the classical Wiener-Hopf equation. Any convex and not necessarily differentiable function can be used...
Konstantinos Slavakis, Yannis Kopsinis, Sergios Th...
COCO
1990
Springer
106views Algorithms» more  COCO 1990»
14 years 1 months ago
The Boolean Hierarchy and the Polynomial Hierarchy: a Closer Connection
We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH3(k), where BH3(k) is the kth level of the Boolean hierarchy over P 2 . Th...
Richard Chang, Jim Kadin
GECCO
2000
Springer
101views Optimization» more  GECCO 2000»
14 years 17 days ago
Polynomial Time Summary Statistics for Two general Classes of Functions
In previous work we showed, by Walsh analysis, that summary statistics such as mean, variance, skew, and higher order statistics can be computed in polynomial time for embedded la...
Robert B. Heckendorn
CASC
2007
Springer
112views Mathematics» more  CASC 2007»
14 years 3 months ago
Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...
Michael B. Monagan, Roman Pearce
FOCM
2006
59views more  FOCM 2006»
13 years 9 months ago
Newton-Hensel Interpolation Lifting
The main result of this paper is a new version of Newton-Hensel lifting that relates to interpolation questions. It allows one to lift polynomials in Z[x] from information modulo a...
Martin Avendano, Teresa Krick, Ariel Pacetti