In this paper, we propose an efficient technique for run-time application mapping onto Network-on-Chip (NoC) platforms with multiple voltage levels. Our technique consists of a re...
r of Unentanglement (Extended Abstract) Scott Aaronson MIT Salman Beigi MIT Andrew Drucker MIT Bill Fefferman University of Chicago Peter Shor MIT The class QMA (k), introduced by...
Scott Aaronson, Salman Beigi, Andrew Drucker, Bill...
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
Faults attacks are a powerful tool to break some implementations of robust cryptographic algorithms such as AES [8] and DES [3]. Various methods of faults attack on cryptographic ...
Stability has been explored to study the performance of learning algorithms in recent years and it has been shown that stability is sufficient for generalization and is sufficient ...