Moses Charikar
Moses Charikar
Professor of Computer Science, Stanford University
cs.stanford.edu üzerinde doğrulanmış e-posta adresine sahip - Ana Sayfa
Başlık
Alıntı yapanlar
Alıntı yapanlar
Yıl
Similarity estimation techniques from rounding algorithms
MS Charikar
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
26152002
Finding frequent items in data streams
M Charikar, K Chen, M Farach-Colton
Theoretical Computer Science 312 (1), 3-15, 2004
15972004
Min-wise independent permutations
AZ Broder, M Charikar, AM Frieze, M Mitzenmacher
Journal of Computer and System Sciences 60 (3), 630-659, 2000
13152000
Multi-probe LSH: efficient indexing for high-dimensional similarity search
Q Lv, W Josephson, Z Wang, M Charikar, K Li
33rd International Conference on Very Large Data Bases, VLDB 2007, 950-961, 2007
9432007
Aggregating inconsistent information: ranking and clustering
N Ailon, M Charikar, A Newman
Journal of the ACM (JACM) 55 (5), 1-27, 2008
8562008
A constant-factor approximation algorithm for the k-median problem
M Charikar, S Guha, É Tardos, DB Shmoys
Journal of Computer and System Sciences 65 (1), 129-149, 2002
7642002
Incremental clustering and dynamic information retrieval
M Charikar, C Chekuri, T Feder, R Motwani
SIAM Journal on Computing 33 (6), 1417-1440, 2004
7472004
Improved combinatorial algorithms for facility location problems
M Charikar, S Guha
SIAM Journal on Computing 34 (4), 803-824, 2005
741*2005
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
6061999
Greedy approximation algorithms for finding dense components in a graph
M Charikar
International Workshop on Approximation Algorithms for Combinatorial …, 2000
4812000
Clustering with qualitative information
M Charikar, V Guruswami, A Wirth
Journal of Computer and System Sciences 71 (3), 360-383, 2005
4762005
The smallest grammar problem
M Charikar, E Lehman, D Liu, R Panigrahy, M Prabhakaran, A Sahai, ...
IEEE Transactions on Information Theory 51 (7), 2554-2576, 2005
435*2005
Algorithms for facility location problems with outliers
M Charikar, S Khuller, DM Mount, G Narasimhan
SODA 1, 642-651, 2001
4122001
Better streaming algorithms for clustering problems
M Charikar, L O'Callaghan, R Panigrahy
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
3432003
Detecting high log-densities: an O(n¼) approximation for densest k-subgraph
A Bhaskara, M Charikar, E Chlamtac, U Feige, A Vijayaraghavan
Proceedings of the forty-second ACM symposium on Theory of computing, 201-210, 2010
3102010
Towards estimation error guarantees for distinct values
M Charikar, S Chaudhuri, R Motwani, V Narasayya
Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on …, 2000
2702000
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
2211998
Maximizing quadratic programs: extending Grothendieck's inequality
M Charikar, A Wirth
45th Annual IEEE Symposium on Foundations of Computer Science, 54-60, 2004
2202004
Modeling lsh for performance tuning
W Dong, Z Wang, W Josephson, M Charikar, K Li
Proceedings of the 17th ACM conference on Information and knowledge …, 2008
2032008
O (√ log n) approximation algorithms for Min UnCut, Min 2CNF Deletion, and directed cut problems
A Agarwal, M Charikar, K Makarychev, Y Makarychev
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
1992005
Sistem, işlemi şu anda gerçekleştiremiyor. Daha sonra yeniden deneyin.
Makaleler 1–20