3172 search results - page 122 / 635 » On the Random-Self-Reducibility of Complete Sets |
130
click to vote
DATE
2003
IEEE
15 years 11 months ago
2003
IEEE
We investigate a characterization of hard-to-detect bridging faults. For circuits with large numbers of lines (or nodes), this characterization can be used to select target faults...
153
click to vote
VTS
2003
IEEE
15 years 11 months ago
2003
IEEE
Irreversible computation necessarily results in energy dissipation due to information loss. While small in comparison to the power consumption of today’s VLSI circuits, if curre...
145
click to vote
PTS
2010
15 years 4 months ago
2010
This paper addresses the challenge of generating test sets that achieve functional coverage, in the absence of a complete specification. The inductive testing technique works by p...
160
click to vote
ACL
2010
15 years 4 months ago
2010
Despite the existence of several noun phrase coreference resolution data sets as well as several formal evaluations on the task, it remains frustratingly difficult to compare resu...
167
click to vote
ADBIS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. DB caching aims at local processing of declarat...