11![A Graph-Coarsening Approach for Tag Recommendation Manel Hmimida Rushed Kanawati LIPN-CNRS UMR 7030 A Graph-Coarsening Approach for Tag Recommendation Manel Hmimida Rushed Kanawati LIPN-CNRS UMR 7030](https://www.pdfsearch.io/img/a5e53e1692d30728959b893915ff1801.jpg) | Add to Reading ListSource URL: gdac.uqam.caLanguage: English - Date: 2017-10-04 00:40:31
|
---|
12![Language and Hardware Acceleration Backend for Graph Processing Andrey Mokhov† , Alessandro de Gennaro† , Ghaith Tarawneh† , Jonny Wray‡ , Georgy Lukyanov† , Sergey Mileiko† , Joe Scott† , Alex Yakovlev† Language and Hardware Acceleration Backend for Graph Processing Andrey Mokhov† , Alessandro de Gennaro† , Ghaith Tarawneh† , Jonny Wray‡ , Georgy Lukyanov† , Sergey Mileiko† , Joe Scott† , Alex Yakovlev†](https://www.pdfsearch.io/img/5acbc0d85610efb3fd039820fe9996d7.jpg) | Add to Reading ListSource URL: www.staff.ncl.ac.ukLanguage: English - Date: 2017-08-19 21:07:39
|
---|
13![Definition of graph complexes Origins and applications Structure of graph homology Applications and Outlook Graph complexes Definition of graph complexes Origins and applications Structure of graph homology Applications and Outlook Graph complexes](https://www.pdfsearch.io/img/b960738870e0c6c842dfa930de842b82.jpg) | Add to Reading ListSource URL: people.math.ethz.chLanguage: English - Date: 2016-05-02 09:25:10
|
---|
14![FIRST PASSAGE PERCOLATION ON A HYPERBOLIC GRAPH ADMITS BI-INFINITE GEODESICS ITAI BENJAMINI AND ROMAIN TESSERA Abstract. Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d. FIRST PASSAGE PERCOLATION ON A HYPERBOLIC GRAPH ADMITS BI-INFINITE GEODESICS ITAI BENJAMINI AND ROMAIN TESSERA Abstract. Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d.](https://www.pdfsearch.io/img/4a9d28093bc21c16e1134febca394cbb.jpg) | Add to Reading ListSource URL: www.normalesup.orgLanguage: English - Date: 2015-12-08 04:38:11
|
---|
15![Neural Network-based Graph Embedding for Cross-Platform Binary Code Similarity Detection Neural Network-based Graph Embedding for Cross-Platform Binary Code Similarity Detection](https://www.pdfsearch.io/img/916171f8efa8b83fd0ccfc40a7a0eae2.jpg) | Add to Reading ListSource URL: acmccs.github.ioLanguage: English - Date: 2017-12-30 21:51:59
|
---|
16![Incremental Call Graph Reanalysis for AspectJ Software Yu Lin, Sai Zhang, Jianjun Zhao School of Software Shanghai Jiao Tong University 800 Dongchuan Road, Shanghai, China {linyu1986, saizhang, zhao-jj}@sjtu.edu.c Incremental Call Graph Reanalysis for AspectJ Software Yu Lin, Sai Zhang, Jianjun Zhao School of Software Shanghai Jiao Tong University 800 Dongchuan Road, Shanghai, China {linyu1986, saizhang, zhao-jj}@sjtu.edu.c](https://www.pdfsearch.io/img/ee3dd8e43469a0903bc259718a0a51ef.jpg) | Add to Reading ListSource URL: zhang-sai.github.ioLanguage: English - Date: 2015-05-05 00:58:34
|
---|
17![Wedge: A New Frontier for Pull-based Graph Processing Wedge: A New Frontier for Pull-based Graph Processing](https://www.pdfsearch.io/img/d4ef70ed4ff19d2a8773a05763f69620.jpg) | Add to Reading ListSource URL: platformlab.stanford.edu- Date: 2018-06-18 15:29:52
|
---|
18![LOCAL-TO-GLOBAL RIGIDITY OF BRUHAT-TITS BUILDINGS MIKAEL DE LA SALLE AND ROMAIN TESSERA Abstract. A vertex-transitive graph X is called local-to-global rigid if there exists R such that every other graph whose balls of r LOCAL-TO-GLOBAL RIGIDITY OF BRUHAT-TITS BUILDINGS MIKAEL DE LA SALLE AND ROMAIN TESSERA Abstract. A vertex-transitive graph X is called local-to-global rigid if there exists R such that every other graph whose balls of r](https://www.pdfsearch.io/img/63ccecd29191ff385a1fb149bc361c25.jpg) | Add to Reading ListSource URL: www.normalesup.orgLanguage: English - Date: 2015-12-08 04:58:35
|
---|
19![Euclidean vs. Graph Metric Itai Benjamini Euclidean vs. Graph Metric Itai Benjamini](https://www.pdfsearch.io/img/08261b3d48a0ad32726b4824b898ea6c.jpg) | Add to Reading ListSource URL: www.wisdom.weizmann.ac.ilLanguage: English - Date: 2014-05-08 03:01:23
|
---|