Sciweavers

358 search results - page 49 / 72
» GCD of Many Integers
Sort
View
DATE
2010
IEEE
111views Hardware» more  DATE 2010»
14 years 18 days ago
Instruction precomputation with memoization for fault detection
—Fault tolerance (FT) has become a major concern in computing systems. Instruction duplication has been proposed to verify application execution at run time. Two techniques, inst...
Demid Borodin, Ben H. H. Juurlink
ISPAN
2002
IEEE
14 years 13 days ago
On the Impact of Naming Methods for Heap-Oriented Pointers in C Programs
Many applications written in C allocate memory blocks for their major data structures from the heap space at runtime. The analysis of heap-oriented pointers in such programs is cr...
Tong Chen, Jin Lin, Wei-Chung Hsu, Pen-Chung Yew
ISSAC
2001
Springer
123views Mathematics» more  ISSAC 2001»
13 years 12 months ago
A probabilistic algorithm to test local algebraic observability in polynomial time
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...
Alexandre Sedoglavic
ACISP
2000
Springer
13 years 12 months ago
An Extremely Small and Efficient Identification Scheme
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...
William D. Banks, Daniel Lieman, Igor Shparlinski
MICRO
1999
IEEE
109views Hardware» more  MICRO 1999»
13 years 11 months ago
Compiler-Directed Dynamic Computation Reuse: Rationale and Initial Results
Recent studies on value locality reveal that many instructions are frequently executed with a small variety of inputs. This paper proposes an approach that integrates architecture...
Daniel A. Connors, Wen-mei W. Hwu