1![Probabilistic Path Hamiltonian Monte Carlo Vu Dinh * 1 Arman Bilge * 1 2 Cheng Zhang * 1 Frederick A. Matsen IV 1 Abstract Hamiltonian Monte Carlo (HMC) is an efficient and effective means of sampling posterior distribut Probabilistic Path Hamiltonian Monte Carlo Vu Dinh * 1 Arman Bilge * 1 2 Cheng Zhang * 1 Frederick A. Matsen IV 1 Abstract Hamiltonian Monte Carlo (HMC) is an efficient and effective means of sampling posterior distribut](https://www.pdfsearch.io/img/9021dd67c2a97f80090a8ad514785261.jpg) | Add to Reading ListSource URL: matsen.fhcrc.orgLanguage: English - Date: 2018-06-27 12:49:21
|
---|
2![How Euler Did It by Ed Sandifer Knight’s Tour April 2006 It is sometimes difficult to imagine that Euler had a social life, but it is not surprising that he could find mathematics in what other people did for fun. He b How Euler Did It by Ed Sandifer Knight’s Tour April 2006 It is sometimes difficult to imagine that Euler had a social life, but it is not surprising that he could find mathematics in what other people did for fun. He b](https://www.pdfsearch.io/img/47b1dd06625c387559b1cf26cf16e9bd.jpg) | Add to Reading ListSource URL: eulerarchive.maa.orgLanguage: English - Date: 2013-11-04 12:20:24
|
---|
3![How to apply de Bruijn graphs to genome assembly How to apply de Bruijn graphs to genome assembly](https://www.pdfsearch.io/img/3a0a694706b010080e18880106bf0974.jpg) | Add to Reading ListSource URL: www.nature.comLanguage: English - Date: 2012-01-20 11:24:28
|
---|
4![ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti ETH Zurich, Department of Computer Science FS 2015 Prof. Dr. Ueli Maurer Dr. Martin Hirt Sandro Coretti](https://www.pdfsearch.io/img/4da6fc52766b5df5599c071b347a4453.jpg) | Add to Reading ListSource URL: www.crypto.ethz.chLanguage: English - Date: 2015-04-20 05:14:26
|
---|
5![Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that](https://www.pdfsearch.io/img/93a8599664e019fcdfbc931b41db220f.jpg) | Add to Reading ListSource URL: page.math.tu-berlin.deLanguage: English |
---|
6![TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel](https://www.pdfsearch.io/img/57805ac8365dd566534644329f10297f.jpg) | Add to Reading ListSource URL: www.iwr.uni-heidelberg.deLanguage: English - Date: 2013-06-19 04:16:58
|
---|
7![TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel](https://www.pdfsearch.io/img/a0d3acff4bd6b2f1005c19e72ac5feb2.jpg) | Add to Reading ListSource URL: comopt.ifi.uni-heidelberg.deLanguage: English - Date: 2013-06-19 04:16:58
|
---|
8![Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na](https://www.pdfsearch.io/img/74a3e7ab8b2ea105bdd42855c7abe74f.jpg) | Add to Reading ListSource URL: pagesperso.lina.univ-nantes.frLanguage: English - Date: 2012-04-20 08:45:09
|
---|
9![An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de](https://www.pdfsearch.io/img/f2c863270aea4ed15e420a3d3411d201.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2008-11-30 14:19:38
|
---|
10![Cryptographic Protocols Spring 2015 Slides for Chapter 1 (6th lecture)
Hamiltonian cycles Cryptographic Protocols Spring 2015 Slides for Chapter 1 (6th lecture)
Hamiltonian cycles](https://www.pdfsearch.io/img/52bdb4ede9f7ed942aa33c20705c3e48.jpg) | Add to Reading ListSource URL: www.crypto.ethz.chLanguage: English - Date: 2015-03-30 06:00:41
|
---|