736 search results - page 77 / 148 » Algorithms for Ordinal Arithmetic |
ISSAC
1992
Springer
13 years 11 months ago
1992
Springer
Abstract. Lattice basis reduction is an important problem in geometry of numbers with applications in combinatorial optimization, computer algebra, and cryptography. The well-known...
DGCI
2006
Springer
13 years 11 months ago
2006
Springer
We introduce a new discrete primitive, the blurred piece of a discrete plane, which relies on the arithmetic definition of discrete planes. It generalizes such planes, admitting th...
TC
2011
13 years 2 months ago
2011
Abstract—The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already avai...
SP
2010
IEEE
13 years 2 months ago
2010
IEEE
The Computational Fluid Dynamics code Overflow includes as one of its solver options an algorithm which is a fairly small piece of code but which accounts for a significant portio...
ICCD
2001
IEEE
14 years 4 months ago
2001
IEEE
In 1987 Sedlak proposed a modulo multiplication algorithm which is suitable for smart card implementation due to it’s low latency time. It is based on ZDN (zwei_drittel_N) arith...