6 citations · 15 across the 9 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014
Sampling in Space Restricted Settings
Anup Bhattacharya, Davis Issac, Ragesh Jaiswal +1
Space efficient algorithms play a central role in dealing with large amount of data. In such settings, one would like to analyse the large data using small amount of "working space…
cs.DS2014★ 3 cited
A tight lower bound instance for k-means++ in constant dimension
Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon
The k-means++ seeding algorithm is one of the most popular algorithms that is used for finding the initial centers when using the k-means heuristic. The algorithm is a simple s…