Kanat Tangwongsan
where else to find them
what they talk about
where they keep going back
no series more than once — all 1 in the filters
on a stage with
never shared a talk
who talks about the same things
one talk is not yet a subject
| title | conference | date |
|---|---|---|
| Parallelization by Approximation | Parallel and Distributed Algorithms for Inference and Optimization (Simons Institute, Oct. 21–24, 2013) | 2013-10-21 |
Shows how greedy set cover becomes parallel by geometric bucketing plus a near-maximal independent-set routine that uses random priorities, yielding… | ||
| nothing matches | ||