Export Reviews, Discussions, Author Feedback and Meta-Reviews

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. Summary of the paper: The paper studies the incremental clustering problem and shows several properties: - It shows that no deterministic memory-bounded incremental clustering method is nice-detecting. Specifically, the authors show that no deterministic nice-detecting incremental clustering algorithm can use less than 2^{cp-1} bits of memory for data in R^p under the l2 metric. Then some example algorithms are displayed. General comments: - The paper is written clearly and the guarantees in this paper are solid.