Ravi Kumar
Jump to navigation
Jump to search
Ravi Kumar is a person.
- See: Large Graph, Graph Mining.
References
- Professional Homepage: https://sites.google.com/site/ravik53/
- DBLP Page: http://www.informatik.uni-trier.de/~ley/pers/hd/k/Kumar:Ravi.html
- Google Scholar Author Page: http://scholar.google.com/citations?user=J_XhIsgAAAAJ
2009
- (Dalvi et al., 2009) ⇒ Nilesh Dalvi, Ravi Kumar, Bo Pang, and Andrew Tomkins. (2009). “Matching Reviews to Objects Using a Language Model. In: Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing (EMNLP 2009).
- (Backstrom et al., 2009) ⇒ Lars Backstrom, Ravi Kumar, and Jon Kleinberg. (2009). “Optimizing Web Traffic via the Media Scheduling Problem.” In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2009). doi:10.1145/1557019.1557036
2008
- (Anagnostopoulos et al., 2008) ⇒ Aris Anagnostopoulos, Ravi Kumar, and Mohammad Mahdian. (2008). “Influence and correlation in social networks.” In: Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2008) doi:10.1145/1401890.1401897
- (Chakrabarti et al., 2008) ⇒ Deepayan Chakrabarti, Ravi Kumar, and Kunal Punera. (2008). “Generating Succinct Titles for Web URLs.” In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2008). doi:10.1145/1401890.1401905
- (Leskovec, Backstrom et al., 2008) ⇒ Jure Leskovec, Lars Backstrom, Ravi Kumar, and Andrew Tomkins. (2008). “Microscopic Evolution of Social Networks.” In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge discovery and data mining, pp. 462-470 . ACM,
2005
- (Gibson et al., 2005) ⇒ David Gibson, Ravi Kumar, and Andrew Tomkins. (2005). “Discovering Large Dense Subgraphs in Massive Graphs.” In: Proceedings of the 31st International Conference on Very large data bases. ISBN:1-59593-154-6
2003
- (Fagin et al., 2003b) ⇒ Ronald Fagin, Ravi Kumar, and D. Sivakumar. (2003). “Comparing Top k Lists.” In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2003).
2000
- (Broder et al., 2000) ⇒ Andrei Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, and Janet Wienerc. (2000). “ Graph structure in the Web.” In: Computer Networks, 33(1-6). doi:10.1016/S1389-1286(00)00083-9