25 citations · 26 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2012★ 1 cited
Optimal Time Bounds for Approximate Clustering
Ramgopal Mettu, Greg Plaxton
Clustering is a fundamental problem in unsupervised learning, and has been studied widely both as a problem of learning mixture models and as an optimization problem. In this paper…
cs.DS2012★ 25 cited
Adaptive Inference on General Graphical Models
Umut A. Acar, Alexander T. Ihler, Ramgopal Mettu +1
Many algorithms and applications involve repeatedly solving variations of the same inference problem; for example we may want to introduce new evidence to the model or perform upda…