Travelled to:1 × China
2 × Canada
7 × USA
Collaborated with:R.Kumar T.Sarlós D.Sivakumar A.Sasturkar A.Anagnostopoulos B.Chen X.Wang J.Yang P.Raghavan A.Tomkins E.Anshelevich É.Tardos T.Wexler K.Q.Weinberger J.Langford A.J.Smola J.Attenberg P.Drineas B.Harb V.Josifovski M.W.Mahoney
Talks about:featur (2) hash (2) lindenstrauss (1) transform (1) multitask (1) communiti (1) algorithm (1) question (1) approxim (1) variabl (1)
Person: Anirban Dasgupta
DBLP: Dasgupta:Anirban
Contributed to:
2012
20122011
2010
20092008
2008200720052003Wrote 10 papers:
- KDD-2012-DasguptaKS #social
- Social sampling (AD, RK, DS), pp. 235–243.
- SIGIR-2012-ChenDWY #community
- Vote calibration in community question-answering systems (BCC, AD, XW, JY), pp. 781–790.
- KDD-2011-DasguptaKS #performance
- Fast locality-sensitive hashing (AD, RK, TS), pp. 1073–1081.
- STOC-2010-DasguptaKS
- A sparse Johnson: Lindenstrauss transform (AD, RK, TS), pp. 341–350.
- ICML-2009-WeinbergerDLSA #learning #multi #scalability
- Feature hashing for large scale multitask learning (KQW, AD, JL, AJS, JA), pp. 1113–1120.
- KDD-2008-DasguptaKS
- De-duping URLs via rewrite rules (AD, RK, AS), pp. 186–194.
- PODS-2008-AnagnostopoulosDK #algorithm #approximate #clustering
- Approximation algorithms for co-clustering (AA, AD, RK), pp. 201–210.
- KDD-2007-DasguptaDHJM #classification #feature model
- Feature selection methods for text classification (AD, PD, BH, VJ, MWM), pp. 230–239.
- KDD-2005-DasguptaKRT #semantics
- Variable latent semantic indexing (AD, RK, PR, AT), pp. 13–21.
- STOC-2003-AnshelevichDTW #design #network
- Near-optimal network design with selfish agents (EA, AD, ÉT, TW), pp. 511–520.