358 search results - page 40 / 72 » Sparse squares of polynomials |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
We propose a “compressive” estimator of the Wigner-Ville spectrum (WVS) for time-frequency sparse, underspread, nonstationary random processes. A novel WVS estimator involving...
ISCAS
2002
IEEE
14 years 20 days ago
2002
IEEE
Frequency-response masking (FRM) technique produces a filter network which comprises several sub-filters with very sparse coefficient values. If the sub-filters are optimized ...
ICPPW
2006
IEEE
14 years 1 months ago
2006
IEEE
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. For sparse po...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
We consider a variant of the traditional task of explicitly reconstructing algebraic functions from black box representations. In the traditional setting for such problems, one is ...