💀 The Wall of Shame
The most cited papers with no code. Sorted by the weight of their sins.
Page 1
| # | Paper | Cause of Death | Category | Citations | Published |
|---|---|---|---|---|---|
| 1 | Guarantees for Greedy Maximization of Non-submodular Functions with Applications | 🔮 The Ethereal | cs.DM | 254 | 9 years ago |
| 2 | On Unbalanced Optimal Transport: An Analysis of Sinkhorn Algorithm | 🔮 The Ethereal | cs.CC | 98 | 6 years ago |
| 3 | Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms | 🔮 The Ethereal | cs.CC | 48 | 9 years ago |
| 4 | Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? | 🔮 The Ethereal | cs.DM | 48 | 8 years ago |
| 5 | Faster Greedy MAP Inference for Determinantal Point Processes | 🔮 The Ethereal | cs.DM | 27 | 9 years ago |