252 citations
- Yahoo (United States)US11 papers
- Yahoo (Spain)ES8 papers
- Telefonica Research and DevelopmentES7 papers
- IBM (United States)US4 papers
- University of CambridgeGB4 papers
- Cornell UniversityUS3 papers
- Johns Hopkins UniversityUS3 papers
- Microsoft (United States)US3 papers
- University of ChicagoUS3 papers
- Columbia UniversityUS2 papers
- Georgia Institute of TechnologyUS2 papers
- Google (United States)US2 papers
Showing 2014 · cs.DSShow all
3 papers · 2 filters
cs.DS2014★ 5 cited
An Algorithm for Online K-Means Clustering
Edo Liberty, Ram Sriharsha, Maxim Sviridenko
This paper shows that one can be competitive with the k-means objective while operating online. In this model, the algorithm receives vectors v_1,...,v_n one by one in an arbitrary…
cs.DS2014★ 2 cited
Semi-Streaming Algorithms for Annotated Graph Streams
Justin Thaler
Considerable effort has been devoted to the development of streaming algorithms for analyzing massive graphs. Unfortunately, many results have been negative, establishing that a wi…
cs.DS2014★ 3 cited
Scalable Online Betweenness Centrality in Evolving Graphs
Nicolas Kourtellis, Gianmarco De Francisci Morales, Francesco Bonchi
Betweenness centrality is a classic measure that quantifies the importance of a graph element (vertex or edge) according to the fraction of shortest paths passing through it. This…