ResearchTrend.AI
ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations

ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations

Maciej Besta
Cesare Miglioli
P. S. Labini
Jakub Tvetek
Patrick Iff
Raghavendra Kanakagiri
Saleh Ashkboos
Kacper Janda
Michal Podstawski
Grzegorz Kwa'sniewski
Niels Gleinig
Flavio Vella
O. Mutlu
Torsten Hoefler
ArXivPDFHTML

Papers citing "ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations"

6 / 6 papers shown
Title
Demystifying Chains, Trees, and Graphs of Thoughts
Demystifying Chains, Trees, and Graphs of Thoughts
Maciej Besta
Florim Memedi
Zhenyu Zhang
Robert Gerstenberger
Guangyuan Piao
...
Aleš Kubíček
H. Niewiadomski
Aidan O'Mahony
Onur Mutlu
Torsten Hoefler
AI4CE
LRM
75
27
0
25 Jan 2024
Parallel Algorithms for Finding Large Cliques in Sparse Graphs
Parallel Algorithms for Finding Large Cliques in Sparse Graphs
Lukas Gianinazzi
Maciej Besta
Yannick Schaffner
Torsten Hoefler
64
21
0
20 Sep 2021
Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges
Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges
M. Bronstein
Joan Bruna
Taco S. Cohen
Petar Velivcković
GNN
174
1,106
0
27 Apr 2021
SlimSell: A Vectorizable Graph Representation for Breadth-First Search
SlimSell: A Vectorizable Graph Representation for Breadth-First Search
Maciej Besta
Florian Marending
Edgar Solomonik
Torsten Hoefler
59
64
0
19 Oct 2020
Geometric deep learning: going beyond Euclidean data
Geometric deep learning: going beyond Euclidean data
M. Bronstein
Joan Bruna
Yann LeCun
Arthur Szlam
P. Vandergheynst
GNN
253
3,239
0
24 Nov 2016
Scaling betweenness centrality using communication-efficient sparse matrix multiplication
Scaling betweenness centrality using communication-efficient sparse matrix multiplication
Edgar Solomonik
Maciej Besta
Flavio Vella
Torsten Hoefler
51
77
0
22 Sep 2016