Seguir
Sudipto Guha
Sudipto Guha
`
Dirección de correo verificada de cis.upenn.edu
Título
Citado por
Citado por
Año
Cure: an efficient clustering algorithm for large databases
S Guha, R Rastogi, K Shim
Information systems 26 (1), 35-58, 2001
50372001
ROCK: A robust clustering algorithm for categorical attributes
S Guha, R Rastogi, K Shim
Data Engineering, 1999. Proceedings., 15th International Conference on, 512-521, 1999
29601999
Approximation algorithms for connected dominating sets
S Guha, S Khuller
Algorithmica 20, 374-387, 1998
17511998
Clustering data streams
S Guha, N Mishra, R Motwani, L O'Callaghan
Foundations of Computer Science, 2000
1227*2000
Clustering data streams: Theory and practice
S Guha, A Meyerson, N Mishra, R Motwani, L O'Callaghan
IEEE transactions on knowledge and data engineering 15 (3), 515-528, 2003
11892003
Streaming-data algorithms for high-quality clustering
L O'callaghan, N Mishra, A Meyerson, S Guha, R Motwani
Proceedings 18th International Conference on Data Engineering, 685-694, 2002
9682002
Greedy strikes back: Improved facility location algorithms
S Guha, S Khuller
Journal of algorithms 31 (1), 228-248, 1999
9011999
A constant-factor approximation algorithm for the k-median problem
M Charikar, S Guha, É Tardos, DB Shmoys
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
8831999
Approximation algorithms for directed Steiner problems
M Charikar, C Chekuri, TY Cheung, Z Dai, A Goel, S Guha, M Li
Journal of Algorithms 33 (1), 73-91, 1999
6601999
Improved combinatorial algorithms for the facility location and k-median problems
M Charikar, S Guha
Foundations of Computer Science, 1999. 40th Annual Symposium on, 378-388, 1999
6321999
Data-streams and histograms
S Guha, N Koudas, K Shim
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
4092001
Robust Random Cut Forest Based Anomaly Detection On Streams
S Guha, N Mishra, G Roy, O Schrijvers
Proceedings of The 33rd International Conference on Machine Learning, 2712-2721, 2016
3872016
Fast, small-space algorithms for approximate histogram maintenance
AC Gilbert, S Guha, P Indyk, Y Kotidis, S Muthukrishnan, MJ Strauss
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
3832002
Near-optimal sparse Fourier representations via sampling
AC Gilbert, S Guha, P Indyk, S Muthukrishnan, M Strauss
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
3732002
Graph sketches: sparsification, spanners, and subgraphs
KJ Ahn, S Guha, A McGregor
Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of …, 2012
3702012
Analyzing graph structure via linear measurements
KJ Ahn, S Guha, A McGregor
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete …, 2012
3462012
Dynamic multidimensional histograms
N Thaper, S Guha, P Indyk, N Koudas
Proceedings of the 2002 ACM SIGMOD international conference on Management of …, 2002
3022002
Approximating the throughput of multiple machines in real-time scheduling
A Bar-Noy, S Guha, JS Naor, B Schieber
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
2661999
Improved methods for approximating node weighted steiner trees and connected dominating sets
S Guha, S Khuller
Information and computation 150 (1), 57-74, 1999
2641999
Approximating a finite metric by a small number of tree metrics
M Charikar, C Chekuri, A Goel, S Guha, S Plotkin
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998
2351998
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20