358 search results - page 2 / 72 » Sparse squares of polynomials |
ICASSP
2010
IEEE
13 years 6 months ago
2010
IEEE
Algorithms such as Least Median of Squares (LMedS) and Random Sample Consensus (RANSAC) have been very successful for low-dimensional robust regression problems. However, the comb...
ISNN
2007
Springer
14 years 13 days ago
2007
Springer
Nonnegative Matrix and Tensor Factorization (NMF/NTF) and Sparse Component Analysis (SCA) have already found many potential applications, especially in multi-way Blind Source Separ...
DCC
2004
IEEE
14 years 5 months ago
2004
IEEE
A Latin square L = L( ij) over the set S = {0, 1, . . . , n - 1} is called totally non-polynomial over Zn iff
IPCO
2008
13 years 7 months ago
2008
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
ICASSP
2009
IEEE
14 years 1 months ago
2009
IEEE
Sampling error due to jitter, or noise in the sample times, affects the precision of analog-to-digital converters in a significant, nonlinear fashion. In this paper, a polynomial...