507 search results - page 18 / 102 » Computing Sparse Multiples of Polynomials |
AAECC
2000
Springer
14 years 11 months ago
2000
Springer
Computing only the low degree terms of the product of two univariate polynomials is called a short multiplication. By decomposition into subproblems, a short multiplication can be ...
CVPR
2010
IEEE
14 years 9 months ago
2010
IEEE
We address the problem of computing joint sparse representation of visual signal across multiple kernel-based representations. Such a problem arises naturally in supervised visual...
103
click to vote
ISSAC
2007
Springer
15 years 5 months ago
2007
Springer
We report on a high-level categorical parallel framework, written in the Aldor language, to support high-performance computer algebra on symmetric multi-processors and multicore p...
MOC
1998
14 years 11 months ago
1998
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
101
click to vote
CORR
2008
Springer
14 years 11 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...