1469 search results - page 59 / 294 » Approximate polynomial decomposition |
FPL
2003
Springer
15 years 3 months ago
2003
Springer
This paper presents a method for evaluating functions in hardware based on polynomial approximation with non-uniform segments. The novel use of nonuniform segments enables us to ap...
JC
2010
14 years 4 months ago
2010
We prove that some multivariate linear tensor product problems are tractable in the worst case setting if they are defined as tensor products of univariate problems with logarithm...
FCCM
2004
IEEE
15 years 1 months ago
2004
IEEE
This poster proposes a technique, based on polynomial approximation, which can be applied to convert ROMs into a combination of arithmetic operations and smaller ROMs. We show tha...
171
click to vote
CODCRY
2011
Springer
14 years 1 months ago
2011
Springer
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n − p n(n − 2t − 2) err...
266
click to vote
ICA
2012
Springer
13 years 5 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...