Locality sensitive hashing (French Wikipedia)

Analysis of information sources in references of the Wikipedia article "Locality sensitive hashing" in French language version.

Last modified: 11:59:16, 28 February 2025 (UTC)

Ref.Un. Ref.Website

Global rank French rank

476^th place

751^st place

2^nd place

3^rd place

1,200^th place

1,303^rd place

acm.org (Global: 1,200^th place; French: 1,303^rd place)

(en) Moses S. Charikar, « Similarity Estimation Techniques from Rounding Algorithms », Proceedings of the 34th Annual ACM Symposium on Theory of Computing 2002,‎ 2002, (ACM 1–58113–495–9/02/0005)… (DOI 10.1145/509907.509965, lire en ligne, consulté le 21 décembre 2007)

(en) Moses S. Charikar, « Similarity Estimation Techniques from Rounding Algorithms », Proceedings of the 34th Annual ACM Symposium on Theory of Computing 2002,‎ 2002, (ACM 1–58113–495–9/02/0005)… (DOI 10.1145/509907.509965, lire en ligne, consulté le 21 décembre 2007)

(en) Gionis, P. Indyk et Rajeev Motwani, « Similarity Search in High Dimensions via Hashing », Proceedings of the 25th Very Large Database (VLDB) Conference,‎ 1999 (lire en ligne)
(en) Piotr Indyk et Rajeev Motwani, « Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality. », Proceedings of 30th Symposium on Theory of Computing,‎ 1998 (lire en ligne)
(en) Alexandr Andoni et Piotr Indyk, « Near-optimal hashing algorithm for approximate nearest neighbour in high dimensions », Communications of the ACM, Vol. 51,‎ 2008 (lire en ligne)