6 citations · 33 across the 33 of their papers we have counts for
5 papers · 1 filter
The Combinatorial Data Fusion Problem in Conflicted-supervised Learning
R. W. R. Darling, David G. Harris, Dev R. Phulara +1
The best merge problem in industrial data science generates instances where disparate data sources place incompatible relational structures on the same set of objects. Graph ve…
Approximation algorithms for stochastic clustering
David G. Harris, Shi Li, Thomas Pensyl +2
We consider stochastic settings for clustering, and develop provably-good approximation algorithms for a number of these notions. These algorithms yield better approximation ratios…
Distributed local approximation algorithms for maximum matching in graphs and hypergraphs
David G. Harris
We describe approximation algorithms in Linial's classic LOCAL model of distributed computing to find maximum-weight matchings in a hypergraph of rank . Our main result is a det…
Derandomizing the Lovasz Local Lemma via log-space statistical tests
David G. Harris
The Lovász Local Lemma (LLL) is a keystone principle in probability theory, guaranteeing the existence of configurations which avoid a collection of "bad" events which…
Bounds and algorithms for graph trusses
Paul Burkhardt, Vance Faber, David G. Harris
The -truss, introduced by Cohen (2005), is a graph where every edge is incident to at least triangles. This is a relaxation of the clique. It has proved to be a useful tool…