A distributed asynchronous relaxation algorithm for the assignment problem
By Dimitri P. Bertsekas. 1985
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Jiajun Wu
- Jitendra Malik
- Yoshua Bengio
- Andrea Vedaldi
- Abhinav Kumar Gupta
- Ruslan Salakhutdinov
- Sergey Levine
- Trevor Darrell
Citations in the corpus
- A Point Set Generation Network for 3D Object Reconstruction from a Single Image (2016, methodology): “We therefore implement a (1 + ǫ) approximation scheme given by [2].”
- DeepSDF: Learning Continuous Signed Distance Functions for Shape Representation (2019, methodology): “Although the metric is commonly approximated in the deep learning literature [19] by distributed approximation schemes [5] for speed during training, we compute the metric accurately for evaluation using a more modest number of point samples (500) using [18].”
- Pix3D: Dataset and Methods for Single-Image 3D Shape Modeling (2018, methodology): “In practice, calculating the exact EMD value is computationally expensive; we instead use a (1 + ) approximation algorithm [3].”
- Point Cloud GAN (2018, methodology): “Instead, we consider an approximation provided by Bertsekas (1985).”
- PCN: Point Completion Network (2018, methodology): “In practice, finding the optimal φ is too expensive, so we use an iterative (1 + ) approximation scheme [4].”