Search
Now showing items 291-295 of 295
Automatic Error Elimination by Multi-Application Code Transfer
(2014-10-02)
We present Code Phage (CP), a system for automatically transferring correct code from donor applications into recipient applications to successfully eliminate errors in the recipient. Experimental results using six donor ...
Best-first Enumeration Based on Bounding Conflicts, and its Application to Large-scale Hybrid Estimation
(2018-05-24)
With the rise of autonomous systems, there is a need for them to have high levels of robustness and safety. This robustness can be achieved through systems that are self-repairing. Underlying this is the ability to diagnose ...
Optimal and Player-Replaceable Consensus with an Honest Majority
(2017-03-31)
We construct a Byzantine Agreement protocol that tolerates t < n/2 corruptions, is very efficient in terms of the number of rounds and the number of bits of communication, and satisfies a strong notion of robustness called ...
On the Non-Existence of Blockwise 2-Local PRGs with Applications to Indistinguishability Obfuscation
(2017-04-06)
Lin and Tessaro (Eprint 2017/250) recently proposed indistinguishability obfuscation and functional encryption candidates and proved their security based on a standard assumption on bilinear maps and a non-standard assumption ...
An Efficient Fill Estimation Algorithm for Sparse Matrices and Tensors in Blocked Formats
(2017-06-09)
Tensors, linear-algebraic extensions of matrices in arbitrary dimensions, have numerous applications in computer science and computational science. Many tensors are sparse, containing more than 90% zero entries. Efficient ...