1.7k citations
- Technion – Israel Institute of TechnologyIL151 papers
- Oranim Academic College of EducationIL134 papers
- Tel Aviv UniversityIL55 papers
- Heidelberg UniversityDE36 papers
- Carmel (Israel)IL29 papers
- Columbia UniversityUS25 papers
- Massachusetts Institute of TechnologyUS25 papers
- National Research University Higher School of EconomicsRU25 papers
- University of AmsterdamNL22 papers
- Hebrew University of JerusalemIL21 papers
- Princeton UniversityUS21 papers
- Centre National de la Recherche ScientifiqueFR20 papers
Showing 2015 · cs.DSShow all
2 papers · 2 filters
cs.DS2015★ 3 cited
Minimum Cut of Directed Planar Graphs in O(nloglogn) Time
Shay Mozes, Cyril Nikolaev, Yahav Nussbaum +1
We give an time algorithm for computing the minimum cut (or equivalently, the shortest cycle) of a weighted directed planar graph. This improves the previous fas…
cs.DS2015★ 5 cited
k-Means for Streaming and Distributed Big Sparse Data
Artem Barger, Dan Feldman
We provide the first streaming algorithm for computing a provable approximation to the -means of sparse Big data. Here, sparse Big Data is a set of vectors in …