736 search results - page 54 / 148 » Algorithms for Ordinal Arithmetic |
108
Voted
ANTS
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper presents an investigative account of arbitrary cubic function fields. We present an elementary classification of the signature of a cubic extension of a rati...
121
click to vote
SIGPRO
2008
15 years 2 months ago
2008
: In this letter, an efficient algorithm for three-dimensional (3-D) vector radix decimation in frequency is derived for computing the type-III 3-D discrete W transform (DWT). Comp...
IPL
1998
15 years 2 months ago
1998
A common-multiplicand method to the Montgomery algorithm makes an improvement in speed when the right-to-left binary exponentiation is applied. The idea is that the same common pa...
108
click to vote
ISSAC
2009
Springer
15 years 9 months ago
2009
Springer
We study systems of higher-order linear differential equations having a regular singularity at the origin. Using the properties of matrix polynomials, we develop efficient method...
117
Voted
DGCI
2009
Springer
15 years 5 months ago
2009
Springer
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the MLP is characteristic of the digital convexit...