Scalable Diversity Maximization via Small-size Composable Core-sets (Brief Announcement)

https://dl.acm.org/doi/abs/10.1145/3323165.3323172

Distance-Sensitive Hashing

https://dl.acm.org/doi/abs/10.1145/3196959.3196976

Tight Bounds on the Round Complexity of the Distributed Maximum Coverage Problem

https://arxiv.org/abs/1801.02793

MR-DBSCAN: a scalable MapReduce-based DBSCAN algorithm for heavily skewed data

http://www.academia.edu/download/42729481/MR-DBSCAN_a_scalable_MapReduce-based_DBS20160216-9308-1om7aj6.pdf

Distributed Coverage Maximization via Sketching

https://arxiv.org/pdf/1612.02327.pdf

Scalable K-Means++

https://arxiv.org/pdf/1203.6402.pdf

جلسه ۱۳ بهینه‌سازی محدب

http://stanford.edu/class/ee364a/lectures/conclusions.pdf

در این جلسه به یک کار دیگرش اشاره کرده:

http://web.stanford.edu/~boyd/papers/pdf/admm_slides.pdf

Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

که به نظرم یک جور روش تقسیم و حل است.

گفته در نگاشت-کاهش هم کار می‌کند:

http://web.stanford.edu/~boyd/papers/pdf/admm_talk.pdf

http://web.stanford.edu/~boyd/papers/pdf/admm_slides.pdf

MS&E 317: Algorithms for Modern Data Models

https://stanford.edu/~rezab/amdm/

ویدئوی نگاشت-کاهش (کارگاه یک روزه)

من لینک کل talkها را می‌گذارم بقیه‌اش هم به درد می‌خورد.
https://stanford.edu/~rezab/talks.html

Massively Parallel Algorithms for Computing TIN DEMs and Contour Trees for Large Terrains

https://www.cs.duke.edu/~abhinath/publications/contour_tree.pdf