Sciweavers

208 search results - page 17 / 42
» Arithmetic Operations in the Polynomial Modular Number Syste...
Sort
View
ALENEX
2004
110views Algorithms» more  ALENEX 2004»
13 years 9 months ago
Computation of a Class of COntinued Fraction Constants
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
Loïck Lhote
JSYML
2002
92views more  JSYML 2002»
13 years 7 months ago
Groundwork for Weak Analysis
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
António M. Fernandes, Fernando Ferreira
GIS
2005
ACM
14 years 8 months ago
Use of rational numbers in the design of robust geometric primitives for three-dimensional spatial database systems
A necessary step in the implementation of three-dimensional spatial data types for spatial database systems and GIS is the development of robust geometric primitives. The authors ...
Brian E. Weinrich, Markus Schneider
ISSAC
2007
Springer
177views Mathematics» more  ISSAC 2007»
14 years 1 months ago
Component-level parallelization of triangular decompositions
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
Marc Moreno Maza, Yuzhen Xie
ARITH
2001
IEEE
13 years 11 months ago
On-line Arithmetic for Detection in Digital Communication Receivers
This paper demonstrates the advantages of using on-line arithmetic for traditional and advanced detection algorithms for communication systems. Detection is one of the core comput...
Sridhar Rajagopal, Joseph R. Cavallaro