Amazon / Cambridge University Press / NetFlix / Enron / Google / AltaVista / /
Country
Korea / Denmark / / /
Event
Product Issues / Product Recall / /
Facility
Ninh Pham IT University of Copenhagen Copenhagen / IT University of Copenhagen / MA Rasmus Pagh IT University of Copenhagen Copenhagen / /
IndustryTerm
web duplication detection tasks / electronic media / Web spam / Web Duplicate Detection In / recommender systems / similarity search / web duplicate detection / web duplicate detection tasks / space-eļ¬cient solution / computer applications / near-duplicate web pages / web crawling / web-pages / estimation algorithm / social networks / search engine / /
Organization
Danish National Research Foundation / Cambridge University / Harvard University / National Science Foundation / S1 / MA Rasmus Pagh IT University of Copenhagen Copenhagen / United Nations / International World Wide Web Conference Committee / University of Copenhagen / Ninh Pham IT University of Copenhagen Copenhagen / /
Person
R. Motwani / /
Position
rst author / Prime Minister / author / representative / /
Product
Recall Recall / ratio of both approaches / Odd b=1 / 0.9 / 0.98 100 500 / ratio between Odd Sketches / Concentration / ratio / /
ProgrammingLanguage
J / /
PublishedMedium
The American Mathematical Monthly / /
Technology
RAM / search engine / machine learning / html / Hashing algorithms / Data mining / estimation algorithm / /
Efficient Estimation for High Similarities using Odd Sketches Michael Mitzenmacher Harvard University Cambridge, MA