2009 | ||
---|---|---|
22 | EE | Anirban Dasgupta, Arpita Ghosh, Hamid Nazerzadeh, Prabhakar Raghavan: Online story scheduling in web advertising. SODA 2009: 1275-1284 |
21 | EE | Kilian Weinberger, Anirban Dasgupta, Josh Attenberg, John Langford, Alex J. Smola: Feature Hashing for Large Scale Multitask Learning CoRR abs/0902.2206: (2009) |
20 | EE | Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, Michael W. Mahoney: Sampling Algorithms and Coresets for $\ellp Regression. SIAM J. Comput. 38(5): 2060-2078 (2009) |
2008 | ||
19 | EE | Anirban Dasgupta, Ravi Kumar, Amit Sasturkar: De-duping URLs via rewrite rules. KDD 2008: 186-194 |
18 | EE | Aris Anagnostopoulos, Anirban Dasgupta, Ravi Kumar: Approximation algorithms for co-clustering. PODS 2008: 201-210 |
17 | EE | Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, Michael W. Mahoney: Sampling algorithms and coresets for ℓp regression. SODA 2008: 932-941 |
16 | EE | Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Michael W. Mahoney: Statistical properties of community structure in large social and information networks. WWW 2008: 695-704 |
15 | EE | Jure Leskovec, Kevin J. Lang, Anirban Dasgupta, Michael W. Mahoney: Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters CoRR abs/0810.1355: (2008) |
14 | EE | Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden: The Price of Stability for Network Design with Fair Cost Allocation. SIAM J. Comput. 38(4): 1602-1623 (2008) |
13 | EE | Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler: Near-Optimal Network Design with Selfish Agents. Theory of Computing 4(1): 77-109 (2008) |
2007 | ||
12 | EE | Anirban Dasgupta, Petros Drineas, Boulos Harb, Vanja Josifovski, Michael W. Mahoney: Feature selection methods for text classification. KDD 2007: 230-239 |
11 | EE | Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra: Spectral clustering with limited independence. SODA 2007: 1036-1045 |
10 | EE | Anirban Dasgupta, Arpita Ghosh, Ravi Kumar, Christopher Olston, Sandeep Pandey, Andrew Tomkins: The discoverability of the web. WWW 2007: 421-430 |
9 | EE | Anirban Dasgupta, Petros Drineas, Boulos Harb, Ravi Kumar, Michael W. Mahoney: Sampling Algorithms and Coresets for Lp Regression CoRR abs/0707.1714: (2007) |
8 | André Allavena, Anirban Dasgupta, John E. Hopcroft, Ravi Kumar: Finding (Short) Paths in Social Networks. Internet Mathematics 3(2): (2007) | |
2006 | ||
7 | EE | Anirban Dasgupta, John E. Hopcroft, Ravi Kannan, Pradipta Prometheus Mitra: Spectral Clustering by Recursive Partitioning. ESA 2006: 256-267 |
2005 | ||
6 | EE | Anirban Dasgupta, John E. Hopcroft, Jon M. Kleinberg, Mark Sandler: On Learning Mixtures of Heavy-Tailed Distributions. FOCS 2005: 491-500 |
5 | EE | Anirban Dasgupta, Ravi Kumar, Prabhakar Raghavan, Andrew Tomkins: Variable latent semantic indexing. KDD 2005: 13-21 |
2004 | ||
4 | EE | Elliot Anshelevich, Anirban Dasgupta, Jon M. Kleinberg, Éva Tardos, Tom Wexler, Tim Roughgarden: The Price of Stability for Network Design with Fair Cost Allocation. FOCS 2004: 295-304 |
3 | EE | Anirban Dasgupta, John E. Hopcroft, Frank McSherry: Spectral Analysis of Random Graphs with Skewed Degree Distributions. FOCS 2004: 602-610 |
2003 | ||
2 | EE | Elliot Anshelevich, Anirban Dasgupta, Éva Tardos, Tom Wexler: Near-optimal network design with selfish agents. STOC 2003: 511-520 |
2002 | ||
1 | EE | Anindya C. Patthak, Indrajit Bhattacharya, Anirban Dasgupta, Pallab Dasgupta, P. P. Chakrabarti: Quantified Computation Tree Logic. Inf. Process. Lett. 82(3): 123-129 (2002) |