Andrea Vattani

Artificial Intelligence · 2008–2012

A researcher in the Science corpus: 2 papers; trusts 6 researchers and is trusted by 1 researcher here, as inferred from the citation graph.

Subfields

Whom Andrea Vattani trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. David Arthur
  2. Daniel A. Spielman
  3. Sergei Vassilvitskii
  4. Pavel Berkhin
  5. Shang-Hua Teng

Who trusts Andrea Vattani overall

  1. Frank Nielsen
  2. Bahman Bahmani
  3. Jonathan de Andrade Silva

Papers from Andrea Vattani's perspective

Ordered by how strongly the researchers Andrea Vattani trusts endorse each paper. Same corpus, a different order for every researcher.

  1. Least squares quantization in PCM
  2. Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time (Symposium on the Theory of Computing)
  3. A local search approximation algorithm for k-means clustering (SCG '02)
  4. Data clustering: a review
  5. Clustering Data Streams: Theory and Practice
  6. A Survey of Clustering Data Mining Techniques
  7. The Effectiveness of Lloyd-Type Methods for the k-Means Problem (IEEE Annual Symposium on Foundations of Computer Science)
  8. How slow is the k-means method? (SCG '06)
  9. BIRCH: an efficient data clustering method for very large databases
  10. A model of computation for MapReduce (ACM-SIAM Symposium on Discrete Algorithms)

Their papers