4679 search results - page 570 / 936 » The Timely Computing Base Model and Architecture |
193
click to vote
DAC
2012
ACM
13 years 9 months ago
2012
ACM
Many state-of-the-art approaches on fault-tolerant system design make the simplifying assumption that all faults are detected within a certain time interval. However, based on a d...
185
click to vote
STOC
1999
ACM
15 years 11 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
177
click to vote
DAC
2003
ACM
16 years 4 hour ago
2003
ACM
We present a new technique to examine the trade-off regions of a circuit where its competing performances become “simultaneously optimal”, i.e. Pareto optimal. It is based on ...
148
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
A zap is a two-round, public coin witness-indistinguishable protocol in which the first round, consisting of a message from the verifier to the prover, can be fixed “once and...
185
click to vote
BMVC
2010
15 years 4 months ago
2010
We present an approach for active segmentation based on integration of several cues. It serves as a framework for generation of object hypotheses of previously unseen objects in n...