Publications

Found 16 results

Filters: author is Dasgupta  [Clear All Filters]
2008
Approximation Algorithms for Co-Clustering Anagnostopoulos, A.; Dasgupta, A.; Kumar, R. , PODS, 09/06/2008, Vancouver, (2008) Abstract
De-duping URLs via Rewrite Rules Dasgupta, A.; Kumar, R.; Sasturkar, A. , KDD, Las Vegas, Nevada, USA, (2008)
Statistical Properties of Community Structure in Large Social and Information Networks Leskovec, J.; Lang, K.; Dasgupta, A.; Mahoney, M. , WWW, (2008) Abstract
2007
Feature Selection Methods for Text Classification Dasgupta, A.; Drineas, P.; Harb, B.; Josifovski, V.; Mahoney, M. , KDD, 11/08/2007, San Jose, (2007)
The Discoverability of the Web Dasgupta, A.; Ghosh, A.; Kumar, R.; Olston, C.; Pandey, S.; Tomkins, A. , Proceedings of the Sixteenth International World Wide Web Conference (WWW), (2007) Abstract
Feature Selection Methods for Text Classification Dasgupta, A.; Drineas, P.; Harb, B.; Josifovski, V.; Mahoney, M. , KDD, (2007)
Spectral Clustering with Limited Independence Dasgupta, A.; Hopcroft, J.E.; Kannan, R.; Mitra, P.P. , Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA '07), (2007)
Sampling Algorithms and Coresets for $L_p$ Regression Dasgupta, A.; Drineas, P.; Harb, B.; Kumar, R.; Mahoney, M.W. , (2007)
2006
Spectral Clustering by Recursive Partitioning Dasgupta, A.; Hopcroft, J.E.; Kannan, R.; Mitra, P.P. , Proceedings of European Symposium of Algorithms (ESA '06), (2006)
2005
On Learning Mixtures of Heavy-Tailed Distributions Dasgupta, A.; Hopcroft, J.E.; Kleinberg, J.M.; Sandler, M. , Proceedings of the 46th conference on Foundations of Computer Science (FOCS '05), p.491-500, (2005)
Variable latent semantic indexing. Dasgupta, A.; Kumar, R.; Raghavan, P.; Tomkins, r. , KDD, p.13-21, (2005)
2004
Spectral Analysis of Random Graphs with Skewed Degree Distributions. Dasgupta, A.; Hopcroft, J.E.; McSherry, F. , Proceedings of the 45th conference on Foundations of Computer Science (FOCS '04), p.602-610, (2004)
The Price of Stability for Network Design with Fair Cost Allocation. Anshelevich, E.; Dasgupta, A.; Kleinberg, J.M.; Tardos, E.; Wexler, T.; Roughgarden, T. , Proceedings of the 45th conference on Foundations of Computer Science (FOCS '04), p.295-304, (2004)
2003
Near-optimal network design with selfish agents. Anshelevich, E.; Dasgupta, A.; Tardos, E.; Wexler, T. , Proceedings of the 36th Symposium on Theory of Computing (STOC '04), p.511-520, (2003)
2002
Finding (short) paths in social networks Allavena, r.; Dasgupta, A.; Hopcroft, J.; Kumar, R. , Internet Mathematics, Volume 3, Number 2, (2002)
Quantified Computation Tree Logic. Patthak, A.C.; Bhattacharya, I.; Dasgupta, A.; Dasgupta, P.; Chakrabarti, P.P. , Information Processing Letters, Volume 82, Number 3, p.123-129, (2002)