Luis Rademacher

activity

20062023

most citedThe More, the Merrier: the Blessing of Dimensionality for Learning Large Gaussian Mixtures

29 citations · 106 across the 19 of their papers we have counts for

collaborators

Showing cs.CCShow all

2 papers · 1 filter

cs.CC2014★ 1 cited

Query complexity of sampling and small geometric partitions

Navin Goyal, Luis Rademacher, Santosh Vempala

In this paper we study the following problem: Discrete partitioning problem (DPP): Let $F_{q} P^{n}$ denote the $n$ -dimensional finite projective space over $F_{q}$ . Fo…

cs.CC2006

Dispersion of Mass and the Complexity of Randomized Geometric Algorithms

Luis Rademacher, Santosh Vempala

How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a notio…