no code implementations • 28 May 2024 • Sami Davies, Sergei Vassilvitskii, Yuyan Wang
In practice, Push-Relabel is even faster than what theoretical guarantees can promise, in part because of the use of good heuristics for seeding and updating the iterative algorithm.
no code implementations • 2 Sep 2021 • Sami Davies, Arya Mazumdar, Soumyabrata Pal, Cyrus Rashtchian
Mixtures of high dimensional Gaussian distributions have been studied extensively in statistics and learning theory.
no code implementations • 12 Dec 2020 • Sami Davies, Miklos Z. Racz, Cyrus Rashtchian, Benjamin G. Schiffer
In the usual trace reconstruction problem, the goal is to exactly reconstruct an unknown string of length $n$ after it passes through a deletion channel many times independently, producing a set of traces (i. e., random subsequences of the string).