Login / Signup
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases.
Mark Giesbrecht
Erich Kaltofen
Wen-shin Lee
Published in:
J. Symb. Comput. (2003)
Keyphrases
</>
computationally efficient
orders of magnitude
learning algorithm
significant improvement
feature selection
computational complexity
computational cost
worst case
times faster
highly efficient
machine learning
data structure
power consumption
recently developed