Sciweavers

1795 search results - page 160 / 359
» On the Complexity of Circuit Satisfiability
Sort
View
DELTA
2004
IEEE
14 years 22 days ago
Arithmetic Transformations to Maximise the Use of Compressor Trees
Complex arithmetic computations, especially if derived from bit-level software descriptions, can be very inefficient if implemented directly in hardware (e.g., by translation of t...
Paolo Ienne, Ajay K. Verma
ICCAD
2009
IEEE
101views Hardware» more  ICCAD 2009»
13 years 6 months ago
Compacting test vector sets via strategic use of implications
As the complexity of integrated circuits has increased, so has the need for improving testing efficiency. Unfortunately, the types of defects are also becoming more complex, which...
Nuno Alves, Jennifer Dworak, R. Iris Bahar, Kundan...
ICMCS
2009
IEEE
136views Multimedia» more  ICMCS 2009»
13 years 6 months ago
Single-iteration full-search fractional motion estimation for quad full HD H.264/AVC encoding
Fractional motion estimation (FME) is widely used in video compression standards. In H.264/AVC, the precision of motion vector is down to quarter pixels to improve the coding effi...
Pei-Kuei Tsung, Wei-Yin Chen, Li-Fu Ding, Chuan-Yu...
VLSID
2006
IEEE
129views VLSI» more  VLSID 2006»
14 years 9 months ago
A Stimulus-Free Probabilistic Model for Single-Event-Upset Sensitivity
With device size shrinking and fast rising frequency ranges, effect of cosmic radiations and alpha particles known as Single-Event-Upset (SEU), Single-Eventtransients (SET), is a ...
Mohammad Gh. Mohammad, Laila Terkawi, Muna Albasma...
FOCS
2008
IEEE
14 years 3 months ago
Almost-Natural Proofs
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
Timothy Y. Chow