Travelled to:1 × Greece
2 × USA
Collaborated with:∅ H.B.McMahan M.Young D.Sculley G.Holt D.Sculley D.Ebner J.Grady L.Nie T.Phillips E.Davydov S.Chikkerur D.Liu M.Wattenberg A.M.Hrafnkelsson T.Boulos J.Kubica
Talks about:predict (1) trench (1) repres (1) random (1) altern (1) uniqu (1) treap (1) scale (1) learn (1) click (1)
Person: Daniel Golovin
DBLP: Golovin:Daniel
Contributed to:
2013
2013
2009Wrote 3 papers:
- ICML-c2-2013-GolovinSMY #learning #ram #scalability
- Large-Scale Learning with Less RAM via Randomization (DG, DS, HBM, MY), pp. 325–333.
- KDD-2013-McMahanHSYEGNPDGCLWHBK #predict
- Ad click prediction: a view from the trenches (HBM, GH, DS, MY, DE, JG, LN, TP, ED, DG, SC, DL, MW, AMH, TB, JK), pp. 1222–1230.
- ICALP-v1-2009-Golovin #named
- B-Treaps: A Uniquely Represented Alternative to B-Trees (DG), pp. 487–499.