Travelled to:
1 × Canada
1 × China
1 × Israel
1 × United Kingdom
2 × USA
Collaborated with:
S.Chang J.Wang F.X.Yu W.Liu J.He M.Mohri A.Talwalkar Y.Gong D.Liu T.Jebara Y.Mu
Talks about:
hash (3) compact (2) learn (2) difficulti (1) decomposit (1) hyperplan (1) spectral (1) sequenti (1) neighbor (1) function (1)
Person: Sanjiv Kumar
DBLP: Kumar:Sanjiv
Contributed to:
Wrote 7 papers:
- ICML-c2-2014-YuKGC
- Circulant Binary Embedding (FXY, SK, YG, SFC), pp. 946–954.
- ICML-c3-2013-YuLKJC #learning
- ∝SVM for Learning with Label Proportions (FXY, DL, SK, TJ, SFC), pp. 504–512.
- ICML-2012-HeKC #nearest neighbour #on the
- On the Difficulty of Nearest Neighbor Search (JH, SK, SFC), p. 9.
- ICML-2012-LiuWMKC
- Compact Hyperplane Hashing with Bilinear Functions (WL, JW, YM, SK, SFC), p. 64.
- ICML-2011-LiuWKC #graph
- Hashing with Graphs (WL, JW, SK, SFC), pp. 1–8.
- ICML-2010-WangKC #learning
- Sequential Projection Learning for Hashing with Compact Codes (JW, SK, SFC), pp. 1127–1134.
- ICML-2009-KumarMT #approximate #composition #on the
- On sampling-based approximate spectral decomposition (SK, MM, AT), pp. 553–560.