26 citations · 34 across the 15 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.LG2022
Deep Distance Sensitivity Oracles
Davin Jeong, Allison Gunby-Mann, Sarel Cohen +5
One of the most fundamental graph problems is finding a shortest path from a source to a target node. While in its basic forms the problem has been studied extensively and efficien…
cs.DS2022
Using random graphs to sample repulsive Gibbs point processes with arbitrary-range potentials
Tobias Friedrich, Andreas Göbel, Maximilian Katzmann +2
We study computational aspects of repulsive Gibbs point processes, which are probabilistic models of interacting particles in a finite-volume region of space. We introduce an appro…