10 citations · 12 across the 2 of their papers we have counts for
2 papers
cs.DS2019★ 10 cited
Scalable Nearest Neighbor Search for Optimal Transport
Arturs Backurs, Yihe Dong, Piotr Indyk +2
The Optimal Transport (a.k.a. Wasserstein) distance is an increasingly popular similarity measure for rich data domains, such as images or text documents. This raises the necessity…
cs.DM2016★ 2 cited
A Graph-Theoretic Approach to Multitasking
Noga Alon, Jonathan D. Cohen, Biswadip Dey +6
A key feature of neural network architectures is their ability to support the simultaneous interaction among large numbers of units in the learning and processing of representation…