3 citations · 3 across the 2 of their papers we have counts for
2 papers
math.CO2023
On SAT Solvers and Ramsey-type Numbers
Burcu Canakci, Hannah Christenson, Robert Fleischman +3
We created and parallelized two SAT solvers to find new bounds on some Ramsey-type numbers. For , let be the least such that for all -colorings of the $[n]\t…
cs.LG2017★ 3 cited
Provably noise-robust, regularised -means clustering
Shrinu Kushagra, Yaoliang Yu, Shai Ben-David
We consider the problem of clustering in the presence of noise. That is, when on top of cluster structure, the data also contains a subset of \emph{unstructured} points. Our goal i…