canqin001/Efficient_Graph_Similarity_Computation
[NeurIPS-2021] Slow Learning and Fast Inference: Efficient Graph Similarity Computation via Knowledge Distillation
PythonMIT
Stargazers
- 2019mohamedProteinea
- 2022liupengli
- agjycxysow
- Aloereed
- canqin001
- ChinTsan01
- fly51flyPRIS
- GlassyWuECNU
- gognlin
- guaiyouiBachelor of ZJU, PhD of UNSW
- Gy-HuThe Hong Kong University of Science and Technology
- Happy-amy-star
- HennyJieStanford University
- hungnphan@caddijp
- hyllbd
- ilBarbara
- ilil96
- jackyjsyNortheastern University
- KunpengLi1994Boston, USA
- leeinscky北京邮电大学
- ma-xuNortheastern University
- MaxKinny222South China University of Technology
- MingSun-TseWestlake University
- Murplugg
- qllzzyp
- SaturdayMer
- shijiale0609MIT
- thanit456Siam Commercial Bank
- thu-wangz17Beijing, China
- Tianwen-AI
- Wuuu17shanghai
- wxbbuaa2011UCAS
- wyzjackNortheastern University
- XiaoXiao-WooUESTC, University of Electronic Science and Technology of China
- xingchenzhaoMars
- zhangy0822