Sciweavers

1017 search results - page 53 / 204
» Register computations on ordinals
Sort
View
HPCA
2006
IEEE
14 years 9 months ago
Reducing resource redundancy for concurrent error detection techniques in high performance microprocessors
With reducing feature size, increasing chip capacity, and increasing clock speed, microprocessors are becoming increasingly susceptible to transient (soft) errors. Redundant multi...
Sumeet Kumar, Aneesh Aggarwal
CAIP
1993
Springer
178views Image Analysis» more  CAIP 1993»
14 years 1 months ago
Robust Recovery of Ego-Motion
A robust method is introduced for computing the camera motion (the ego-motion) in a static scene. The method is based on detecting a single planar surface in the scene directly fro...
Michal Irani, Benny Rousso, Shmuel Peleg
ICDCS
2006
IEEE
14 years 3 months ago
Computing in the Presence of Timing Failures
Timing failures refer to a situation where the environment in which a system operates does not behave as expected regarding the timing assumptions, that is, the timing constraints...
Gadi Taubenfeld
QCQC
1998
Springer
110views Communications» more  QCQC 1998»
14 years 1 months ago
The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer
Abstract. A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and hidden ...
Michele Mosca, Artur Ekert
ISSS
1996
IEEE
103views Hardware» more  ISSS 1996»
14 years 1 months ago
Instruction Set Design and Optimizations for Address Computation in DSP Architectures
In this paper we investigate the problem of code generation for address computation for DSP processors. This work is divided into four parts. First, we propose a branch instructio...
Guido Araujo, Ashok Sudarsanam, Sharad Malik