Sciweavers

736 search results - page 54 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
ANTS
2004
Springer
105views Algorithms» more  ANTS 2004»
14 years 1 months ago
Algorithmic Aspects of Cubic Function Fields
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...
Renate Scheidler
SIGPRO
2008
89views more  SIGPRO 2008»
13 years 7 months ago
Radix-2 algorithm for the fast computation of type-III 3-D discrete W transform
: 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...
Huazhong Shu, J. S. Wu, Lotfi Senhadji, Limin Luo
IPL
1998
177views more  IPL 1998»
13 years 7 months ago
A Common-Multiplicand Method to the Montgomery Algorithm for Speeding up Exponentiation
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...
JaeCheol Ha, Sang-Jae Moon
ISSAC
2009
Springer
141views Mathematics» more  ISSAC 2009»
14 years 2 months ago
Algorithms for regular solutions of higher-order linear differential systems
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...
Moulay A. Barkatou, Thomas Cluzeau, Carole El Bach...
DGCI
2009
Springer
13 years 11 months ago
Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
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...
Xavier Provençal, Jacques-Olivier Lachaud