15 citations · 15 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2008
Approximating L1-distances between mixture distributions using random projections
Satyaki Mahalanabis, Daniel Stefankovic
We consider the problem of computing L1-distances between every pair ofcprobability densities from a given family. We point out that the technique of Cauchy random projections (Ind…
cs.DS2006
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wor…