Sciweavers

72 search results - page 1 / 15
» An arithmetic approach for the computing with words paradigm
Sort
View
IJIS
2006
35views more  IJIS 2006»
14 years 9 months ago
An arithmetic approach for the computing with words paradigm
Miguel Delgado, Oscar Germán Duarte, Ignaci...
COMPGEOM
1997
ACM
15 years 1 months ago
Robust Proximity Queries: An Illustration of Degree-Driven Algorithm Design
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
Giuseppe Liotta, Franco P. Preparata, Roberto Tama...
85
Voted
CSL
2007
Springer
15 years 3 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel
ASPDAC
2007
ACM
95views Hardware» more  ASPDAC 2007»
15 years 1 months ago
Optimization of Arithmetic Datapaths with Finite Word-Length Operands
Abstract: This paper presents an approach to area optimization of arithmetic datapaths that perform polynomial computations over bit-vectors with finite widths. Examples of such de...
Sivaram Gopalakrishnan, Priyank Kalla, Florian Ene...
87
Voted
ARITH
2001
IEEE
15 years 1 months ago
Computer Arithmetic-A Processor Architect's Perspective
The Instruction Set Architecture (ISA) of a programmable processor is the native languageof the machine. It defines the set of operations and resourcesthat are optimized for that ...
Ruby B. Lee