681 search results - page 4 / 137 » General Polynomial Time Decomposition Algorithms |
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
ISSAC
1995
Springer
15 years 1 months ago
1995
Springer
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
115
click to vote
CASES
2004
ACM
15 years 2 months ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
ICALP
2009
Springer
15 years 9 months ago
2009
Springer
We give a polynomial time algorithm that computes a decomposition of a finite group G given in the form of its multiplication table. That is, given G, the algorithm outputs two su...
88
Voted
JSC
2008
14 years 9 months ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...