Rajeev Motwani
Rajeev Motwani was a person.
- Context:
- He has Erdős Number of 2 (via Pavol Hell)
- See: Approximate Nearest Neighbor Search, Formal Grammar.
References
- Professional Home Page: http://www.cs.sfu.ca/~pavol/
- Google Scholar Author Page: http://scholar.google.com/citations?user=8KDwlbEAAAAJ
2008
- (Kargupta et al., 2008) ⇒ Hillol Kargupta, Jiawei Han, Philip S. Yu, Rajeev Motwani, and Vipin Kumar, eds. (2008). “Next Generation of Data Mining." CRC Press. ISBN:9781420085860
2005
- (Chaudhuri et al., 2005) ⇒ Surajit Chaudhuri, Venkatesh Ganti, and Rajeev Motwani. (2005). “Robust Identification of Fuzzy Duplicates.” In: Proceedings of the 21st International Conference on Data Engineering (ICDE 2005). doi:10.1109/ICDE.2005.125
2003
- (Chaudhuri et al., 2003) ⇒ Surajit Chaudhuri, Kris Ganjam, Venkatesh Ganti, and Rajeev Motwani. (2003). “Robust and Efficient Fuzzy Match for Online Data Cleaning.” In: Proceedings of the 2003 ACM SIGMOD Conference (SIGMOD 2003). doi:10.1145/872757.872796
2001
- (Hopcroft et al., 2001) ⇒ John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. (2001). “Introduction to Automata Theory, Languages, and Computation, (2nd edition)." Addison Wesley. ISBN:0201441241
1999
- (Feder et al., 1999) ⇒ Tomas Feder, Pavol Hell, Sulamita Klein, and Rajeev Motwani. (1999). “Complexity of Graph Partition Problems.” In: Proceedings of the thirty-first annual ACM symposium on Theory of computing, pp. 464-472. ACM, 1999.
- (Gionis et al., 1999) ⇒ Aristides Gionis, Piotr Indyk, and Rajeev Motwani. (1999). “Similarity Search in High Dimensions via Hashing.” In: Proceedings of the 25th International Confeference on Very Large Data Bases (VLDB 1999).
1998
- (Indyk & Motwani, 1998) ⇒ Piotr Indyk, Rajeev Motwani. (1998). “Approximate Nearest Neighbors: Towards removing the curse of dimensionality.” In: [[Proceedings of the thirtieth annual ACM symposium on Theory of computing]. doi:10.1145/276698.276876
- (Page et al., 1998) ⇒ Larry Page, Sergey Brin, Rajeev Motwani, and Terry Winograd. (1998). “The PageRank Citation Ranking: Bringing order to the web." Technical Report, Stanford University.
1997
- (Indyk et al., 1997) ⇒ Piotr Indyk, Rajeev Motwani, and S. Venkatasubramanian. (1997). “Geometric Matching Under Noise-Combinatorial Bounds and Algorithms.” Manuscript.
- (Brin et al., 1997a) ⇒ Sergey Brin, Rajeev Motwani, J. Ullman, and S. Tsur. (1997). “Dynamic Itemset Counting and Implication Rules for Market Basket Data.” In: Proceedings of the 1997 ACM-SIGMOD International Conference on the Management of Data (SIGMOD 1997).
- (Brin et al., 1997b) ⇒ Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, and Shalom Tsur. (1997). “Dynamic Itemset Counting and Implication Rules for Market Basket Data.” In: ACM SIGMOD Record, vol. 26, no. 2.
1995
- (Motwani & Raghavan, 1995) ⇒ Rajeev Motwani, and Prabhakar Raghavan. (1995). “Randomized Algorithms." Cambridge University Press. ISBN:0521474655