Search Results for author:
Found 2 papers, 1 papers with code
NetGAN without GAN: From Random Walks to Low-Rank Approximations
In this paper, we investigate the implicit bias of NetGAN.
A 4-approximation algorithm for min max correlation clustering
We introduce a lower bounding technique for the min max correlation clustering problem and, based on this technique, a combinatorial 4-approximation algorithm for complete graphs.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
