Moses Charikar
Moses Samson Charikar is an Indian
metric embeddings. He is known for the creation of the SimHash algorithm used by Google for near duplicate detection.[1]
Charikar was born in
Indian Institute of Technology Bombay.[2] In 2000 he completed a doctorate from Stanford University, under the supervision of Rajeev Motwani;[4] he joined the Princeton faculty in 2001.[2]
In 2012 he was awarded the Paris Kanellakis Award along with Andrei Broder and Piotr Indyk for their research on locality-sensitive hashing.[5]
References
- ^
Gurmeet Singh, Manku; Jain, Arvind; Das Sarma, Anish (2007), "Detecting near-duplicates for web crawling", Proceedings of the 16th International Conference on World Wide Web (PDF), S2CID 1414324.
- ^ a b c "Moses Charikar". Princeton University. Archived from the original on 24 December 2013. Retrieved 24 December 2013.
- ^ "Moses Samson Charikar". International Mathematical Olympiad. Retrieved 24 December 2013.
- ^ Moses Charikar at the Mathematics Genealogy Project
- ^ "Moses S Charikar, ACM Paris Kanellakis Theory and Practice Award, United States – 2012". Association for Computing Machinery. Retrieved 24 December 2013.
External links
| International | |
|---|---|
| National | |
| Academics | |
  | This article about an Indian scientist is a stub. You can help Wikipedia by expanding it. |