61![Post-quantum cryptography for long-term security PQCRYPTO ICTPQCrypto Review Meeting / Workshop, Utrecht, the Netherlands, June 28, 2016 Optimizing Post-Quantum Cryptographic Algorithms for Modern and Future Proc Post-quantum cryptography for long-term security PQCRYPTO ICTPQCrypto Review Meeting / Workshop, Utrecht, the Netherlands, June 28, 2016 Optimizing Post-Quantum Cryptographic Algorithms for Modern and Future Proc](https://www.pdfsearch.io/img/ec9e9051211237203f75af20cc13267f.jpg) | Add to Reading ListSource URL: pqcrypto.eu.orgLanguage: English - Date: 2016-06-29 18:47:49
|
---|
62![Analog Circuit Design Using Genetic Algorithms Kenneth V. Noren1 John E. Ross2 Analog Circuit Design Using Genetic Algorithms Kenneth V. Noren1 John E. Ross2](https://www.pdfsearch.io/img/cf25e35af9350b274ae933fc2be660d2.jpg) | Add to Reading ListSource URL: www.johnross.comLanguage: English - Date: 2009-07-03 23:04:15
|
---|
63![Predicting Protein-Protein Interactions with Collaborative Filtering Algorithms István Albert Collaborative Filtering (CF) has proven to be a valuable tool for predicting relevant items in many different domains from e- Predicting Protein-Protein Interactions with Collaborative Filtering Algorithms István Albert Collaborative Filtering (CF) has proven to be a valuable tool for predicting relevant items in many different domains from e-](https://www.pdfsearch.io/img/aae120e58cd62c4cfb32bb8445d8eb6e.jpg) | Add to Reading ListSource URL: biochem218.stanford.eduLanguage: English - Date: 2005-03-28 18:49:36
|
---|
64![On the complexity of some computational problems in the Turing model Claus Diem November 18, 2013 Abstract Algorithms for concrete problems are usually described and analyzed in some random access machine model. This is On the complexity of some computational problems in the Turing model Claus Diem November 18, 2013 Abstract Algorithms for concrete problems are usually described and analyzed in some random access machine model. This is](https://www.pdfsearch.io/img/ae7ebed67e752e7fea65df88b3e9c591.jpg) | Add to Reading ListSource URL: www.mathematik.uni-leipzig.deLanguage: English - Date: 2013-11-18 06:32:25
|
---|
65![Fast Algorithms for Segmented Regression Jayadev Acharya Massachusetts Institute of Technology, Cambridge, MA 02139, USA Ilias Diakonikolas University of Southern California, Los Angeles, MA 90089, USA Fast Algorithms for Segmented Regression Jayadev Acharya Massachusetts Institute of Technology, Cambridge, MA 02139, USA Ilias Diakonikolas University of Southern California, Los Angeles, MA 90089, USA](https://www.pdfsearch.io/img/b5f91a83a6a73ad7e50ae52b45271574.jpg) | Add to Reading ListSource URL: www.iliasdiakonikolas.orgLanguage: English - Date: 2016-06-26 10:19:29
|
---|
66![Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization Abhishek Kumar Dept. of Computer Science, University of Maryland, College Park, MD 20742, USA Vikas Sindhwani Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization Abhishek Kumar Dept. of Computer Science, University of Maryland, College Park, MD 20742, USA Vikas Sindhwani](https://www.pdfsearch.io/img/47e14f165dd8ce88665bf8a5b7885f65.jpg) | Add to Reading ListSource URL: proceedings.mlr.pressLanguage: English - Date: 2018-07-16 03:38:07
|
---|
67![Triangular Networks for Resilient Formations David Salda˜na, Amanda Prorok, Mario F. M. Campos, Vijay Kumar Abstract Consensus algorithms allow multiple robots to achieve agreement on estimates of variables in a distrib Triangular Networks for Resilient Formations David Salda˜na, Amanda Prorok, Mario F. M. Campos, Vijay Kumar Abstract Consensus algorithms allow multiple robots to achieve agreement on estimates of variables in a distrib](https://www.pdfsearch.io/img/29cc7c432691317985b8f780923b10ef.jpg) | Add to Reading ListSource URL: prorok.meLanguage: English - Date: 2016-11-14 21:31:25
|
---|
68![APPROX 2012 and RANDOM 2012 15th Intl. Workshop on Approx. Algorithms for Combinatorial Optimization Problems - APPROX 2012 & 16th Intl. Workshop on Randomization and Computation - RANDOM 2012 http://cui.unige.ch/tcs/ran APPROX 2012 and RANDOM 2012 15th Intl. Workshop on Approx. Algorithms for Combinatorial Optimization Problems - APPROX 2012 & 16th Intl. Workshop on Randomization and Computation - RANDOM 2012 http://cui.unige.ch/tcs/ran](https://www.pdfsearch.io/img/f5093e21bf14fe7c1f6aa6ba8e647d5b.jpg) | Add to Reading ListSource URL: cui.unige.chLanguage: English - Date: 2012-03-28 05:35:32
|
---|
69![THE DUAL TAIWAN-ISRAEL RESEARCH SYMPOSIUM ON THE DUAL TAIWAN-ISRAEL RESEARCH SYMPOSIUM ON](https://www.pdfsearch.io/img/6144ab87a5d994ad42bd1dd377d96510.jpg) | Add to Reading ListSource URL: www2.math.technion.ac.ilLanguage: English - Date: 2011-12-08 15:21:08
|
---|
70![CS 38 Introduction to Algorithms Spring 2014 CS 38 Introduction to Algorithms Spring 2014](https://www.pdfsearch.io/img/558e33eeba2a93d348d4ae1366a8cffb.jpg) | Add to Reading ListSource URL: users.cms.caltech.eduLanguage: English - Date: 2014-05-08 13:15:17
|
---|