3466 search results - page 41 / 694 » Fast computation of special resultants |
APLAS
2004
ACM
14 years 4 months ago
2004
ACM
Abstract. We present a matrix language compiler CMC which translates annotated MATLAB scripts into Fortran 90 programs. Distinguishing features of CMC include its applicability to ...
ISCAS
2005
IEEE
14 years 4 months ago
2005
IEEE
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...
CAD
1999
Springer
13 years 10 months ago
1999
Springer
This paper presents algorithms for computing offsets of NURBS curves and surfaces. The basic approach consists of four steps: (1) recognition of special curves and surfaces; (2) s...
ASSETS
2010
ACM
13 years 11 months ago
2010
ACM
We present a study focusing on the usability of a wayfinding and localization system for persons with visual impairment. This system uses special color markers, placed at key loca...
CTRSA
2006
Springer
14 years 2 months ago
2006
Springer
The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on ...