PulseAugur
EN
LIVE 10:37:25
ENTITY k-sparse Wasserstein barycenter problem

k-sparse Wasserstein barycenter problem

PulseAugur coverage of k-sparse Wasserstein barycenter problem — every cluster mentioning k-sparse Wasserstein barycenter problem across labs, papers, and developer communities, ranked by signal.

Show in brief
Total · 30d
1
1 over 90d
Releases · 30d
0
0 over 90d
Papers · 30d
1
1 over 90d
TIER MIX · 90D
TOPICS
SENTIMENT · 30D

1 day(s) with sentiment data

RECENT · PAGE 1/1 · 1 TOTAL
  1. TOOL · CL_245505 ·

    New algorithm achieves sub-4 approximation for fair k-means clustering

    Researchers have developed a new approximation algorithm for fair k-means clustering, aiming to ensure equitable representation of protected groups within machine learning applications. The algorithm combines linear pro…