79 citations · 306 across the 34 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
cs.DS2010★ 5 cited
An Improved Algorithm for Bipartite Correlation Clustering
Nir Ailon, Noa Avigdor-Elgrabli, Edo Liberty
Bipartite Correlation clustering is the problem of generating a set of disjoint bi-cliques on a set of nodes while minimizing the symmetric difference to a bipartite input graph. T…
cs.DS2010★ 79 cited
An Active Learning Algorithm for Ranking from Pairwise Preferences with an Almost Optimal Query Complexity
Nir Ailon
We study the problem of learning to rank from pairwise preferences, and solve a long-standing open problem that has led to development of many heuristics but no provable results fo…
cs.DS2010
Almost Optimal Unrestricted Fast Johnson-Lindenstrauss Transform
Nir Ailon, Edo Liberty
The problems of random projections and sparse reconstruction have much in common and individually received much attention. Surprisingly, until now they progressed in parallel and r…