Sciweavers

787 search results - page 98 / 158
» Digital Algebra and Circuits
Sort
View
ETS
2006
IEEE
119views Hardware» more  ETS 2006»
16 years 10 days ago
On-Chip Test Generation Using Linear Subspaces
A central problem in built-in self test (BIST) is how to efficiently generate a small set of test vectors that detect all targeted faults. We propose a novel solution that uses l...
Ramashis Das, Igor L. Markov, John P. Hayes
ISAAC
2004
Springer
87views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Random Access to Advice Strings and Collapsing Results
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
Jin-yi Cai, Osamu Watanabe
CORR
2007
Springer
80views Education» more  CORR 2007»
15 years 6 months ago
Polygraphs for termination of left-linear term rewriting systems
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
Yves Guiraud
ASIACRYPT
2010
Springer
15 years 4 months ago
Faster Fully Homomorphic Encryption
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
Damien Stehlé, Ron Steinfeld
AHS
2007
IEEE
252views Hardware» more  AHS 2007»
16 years 19 days ago
A Hybrid Engine for the Placement of Domain-Specific Reconfigurable Arrays
Rapid-prototyping of commercial devices and the demanding requirements for flexible hardware in mobile applications have driven the raise of reconfigurable hardware. The adaptatio...
Wing On Fung, Tughrul Arslan, Sami Khawam