15 citations · 17 across the 3 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2011
Clustering Protein Sequences Given the Approximation Stability of the Min-Sum Objective Function
Konstantin Voevodski, Maria-Florina Balcan, Heiko Roglin +2
We study the problem of efficiently clustering protein sequences in a limited information setting. We assume that we do not know the distances between the sequences in advance, and…
cs.DS2010★ 15 cited
Efficient Clustering with Limited Distance Information
Konstantin Voevodski, Maria-Florina Balcan, Heiko Roglin +2
Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model w…