Travelled to:1 × China
1 × France
1 × Greece
1 × Japan
4 × USA
Collaborated with:∅ B.Chazelle E.Liberty Z.S.Karnin T.Joachims Y.Chen H.Xu M.Charikar A.Newman
Talks about:cluster (4) transform (2) linear (2) bandit (2) lower (2) bound (2) rank (2) lindenstrauss (1) degeneraci (1) intercept (1)
Person: Nir Ailon
DBLP: Ailon:Nir
Contributed to:
2015
20142013
20092009
200620052004Wrote 8 papers:
- ICALP-v1-2015-Ailon #bound #fourier
- Tighter Fourier Transform Lower Bounds (NA), pp. 14–25.
- ICML-c2-2014-AilonKJ
- Reducing Dueling Bandits to Cardinal Bandits (NA, ZSK, TJ), pp. 856–864.
- ICML-c3-2013-AilonCX #clustering #graph
- Breaking the Small Cluster Barrier of Graph Clustering (NA, YC, HX), pp. 995–1003.
- ECIR-2009-Ailon #algorithm #linear #query #ranking #using
- A Simple Linear Ranking Algorithm Using Query Dependent Intercept Variables (NA), pp. 685–690.
- ICALP-v1-2009-AilonL #clustering #correlation #cost analysis #fault #problem
- Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems (NA, EL), pp. 24–36.
- STOC-2006-AilonC #approximate #nearest neighbour #performance
- Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform (NA, BC), pp. 557–563.
- STOC-2005-AilonCN #clustering #consistency #ranking
- Aggregating inconsistent information: ranking and clustering (NA, MC, AN), pp. 684–693.
- STOC-2004-AilonC #bound #linear #testing
- Lower bounds for linear degeneracy testing (NA, BC), pp. 554–560.