814 search results - page 61 / 163 » Analysis of Modular Arithmetic |
CAIP
2007
Springer
15 years 4 months ago
2007
Springer
An algorithm of estimation of the curvature at each point of a general discrete curve in O(nlog2 n) is proposed. It uses the notion of blurred segment, extending the definition of...
ASAP
1997
IEEE
15 years 2 months ago
1997
IEEE
This paper presents a method, based on the formalism of affine recurrence equations, for the synthesis of digital circuits exploiting parallelism at the bit-level. In the initial ...
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms for the following problems in the noncommutative...
AMAI
2007
Springer
14 years 10 months ago
2007
Springer
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
APLAS
2004
ACM
15 years 3 months ago
2004
ACM
Modular programming enjoys many well-known advantages: readability, maintainability, separate development and compilation. However, the composition of modular units (components) s...