activity
20062020
most citedOn the Complexity of Processing Massive, Unordered, Distributed Data

11 citations · 20 across the 11 of their papers we have counts for

collaborators
Showing 2019 · cs.DSShow all

1 paper · 2 filters

cs.DS2019★ 1 cited

A Polynomial Time Algorithm for Log-Concave Maximum Likelihood via Locally Exponential Families

Brian Axelrod, Ilias Diakonikolas, Anastasios Sidiropoulos +2

We consider the problem of computing the maximum likelihood multivariate log-concave distribution for a set of points. Specifically, we present an algorithm which, given points…