534 search results - page 9 / 107 » Efficient polynomial L-approximations |
JSC
2006
13 years 7 months ago
2006
In this paper we give formulas for performing row reduction of a matrix of Ore polynomials in a fraction-free way. The reductions can be used for finding the rank and left nullspa...
HPCS
2009
IEEE
13 years 11 months ago
2009
IEEE
We report efficient implementation techniques for FFT-based dense multivariate polynomial arithmetic over finite fields, targeting multi-cores. We have extended a preliminary study...
WSCG
2004
13 years 9 months ago
2004
This work presents a new method of fast cubic and higher order image interpolation. The evaluation of the piecewise n-th order polynomial kernels is accelerated by transforming th...
ACMSE
2006
ACM
13 years 11 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
ICIP
2009
IEEE
13 years 5 months ago
2009
IEEE
By using Semi-Definite Programming (SDP) as a tool, a new deign for Two-Dimensional (2-D) Diamond-Shaped (DS) filters is developed. Surprisingly, the diamond shape of the filter is...