Edge-Connected Jaccard Similarity for Graph Link Prediction on FPGA

被引：0
|
作者：
Sathre, Paul [1 ]
Gondhalekar, Atharva [2 ]
Feng, Wu-Chun [1 ,2 ]
机构：
[1] Virginia Tech, Dept. of Computer Science, Blacksburg,VA, United States
[2] Virginia Tech, Dept. of Electrical and Computer Engineering, Blacksburg,VA, United States
来源：
2022 IEEE High Performance Extreme Computing Conference, HPEC 2022 | 2022年
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Field programmable gate arrays (FPGA)
引用
收藏
相关论文
共 50 条
  • [31] On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences
    Liu, Xuemei
    Meng, Jixiang
    Tian, Yingzhi
    JOURNAL OF SUPERCOMPUTING, 2023, 79 (14): : 15980 - 15996
  • [32] SUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER
    Volkmann, Lutz
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2019, 39 (02) : 567 - 573
  • [33] On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences
    Xuemei Liu
    Jixiang Meng
    Yingzhi Tian
    The Journal of Supercomputing, 2023, 79 : 15980 - 15996
  • [34] CRITICAL N-FOLD EDGE-CONNECTED GRAPHS
    MADER, W
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1986, 40 (02) : 152 - 158
  • [35] Sufficient Conditions for Maximally Edge-connected and Super-edge-connected Digraphs Depending on the Size
    Sebastian MILZ
    Lutz VOLKMANN
    Acta Mathematica Sinica,English Series, 2019, (12) : 1861 - 1870
  • [36] Sufficient Conditions for Maximally Edge-connected and Super-edge-connected Digraphs Depending on the Size
    Milz, Sebastian
    Volkmann, Lutz
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2019, 35 (12) : 1861 - 1870
  • [37] Sufficient Conditions for Maximally Edge-connected and Super-edge-connected Digraphs Depending on the Size
    Sebastian MILZ
    Lutz VOLKMANN
    ActaMathematicaSinica, 2019, 35 (12) : 1861 - 1870
  • [38] Graph attention network via node similarity for link prediction
    Yang, Kai
    Liu, Yuan
    Zhao, Zijuan
    Zhou, Xingxing
    Ding, Peijin
    EUROPEAN PHYSICAL JOURNAL B, 2023, 96 (03):
  • [39] Graph attention network via node similarity for link prediction
    Kai Yang
    Yuan Liu
    Zijuan Zhao
    Xingxing Zhou
    Peijin Ding
    The European Physical Journal B, 2023, 96
  • [40] Neighborhood conditions for graphs and digraphs to be maximally edge-connected
    Hellwig, Angelika
    Volkmann, Lutz
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2005, 33 : 265 - 277
12345