Background: Computational protein annotation methods occasionally introduce errors. Falsepositive (FP) errors are annotations that are mistakenly associated with a protein. Such f...
We initiate a provable-security treatment of cryptographic agility. A primitive (for example PRFs, authenticated encryption schemes or digital signatures) is agile when multiple, ...
Tolga Acar, Mira Belenkiy, Mihir Bellare, David Ca...
Abstract. Bounded model checking (BMC) based on satisfiability testing (SAT) has been introduced as a complementary technique to BDDbased symbolic model checking of LTL properties ...
Abstract--We propose an automatic method for measuring content-based music similarity, enhancing the current generation of music search engines and recommender systems. Many previo...
Fault-tolerant services typically make assumptions about the type and maximum number of faults that they can tolerate while providing their correctness guarantees; when such a fau...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...