MinHash (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "MinHash" in Spanish language version.

refsWebsite

Global rank Spanish rank

7doi.org

2^nd place

2web.archive.org

1^st place

1dec.com

low place

1columbia.edu

488^th place

747^th place

1bmva.org

low place

1arxiv.org

69^th place

148^th place

1epfl.ch

4,521^st place

9,098^th place

arxiv.org

Zadeh, Reza; Goel, Ashish (2012), Dimension Independent Similarity Computation, arXiv:1206.2082 ..

bmva.org

Chum, Ondřej; Philbin, James; Zisserman, Andrew (2008), «Near duplicate image detection: min-hash and tf-idf weighting», Proceedings of the British Machine Vision Conference 3, p. 4, archivado desde el original el 24 de febrero de 2021, consultado el 19 de diciembre de 2014 ..

columbia.edu

cs.columbia.edu

Vassilvitskii, Sergey (2011), COMS 6998-12: Dealing with Massive Data (lecture notes, Columbia university) ..

dec.com

gatekeeper.dec.com

Broder, Andrei Z. (1997), «On the resemblance and containment of documents», Compression and Complexity of Sequences: Proceedings, Positano, Amalfitan Coast, Salerno, Italy, June 11-13, 1997, IEEE, pp. 21-29, doi:10.1109/SEQUEN.1997.666900, archivado desde el original el 31 de enero de 2015, consultado el 19 de diciembre de 2014 ..

doi.org

dx.doi.org

Broder, Andrei Z. (1997), «On the resemblance and containment of documents», Compression and Complexity of Sequences: Proceedings, Positano, Amalfitan Coast, Salerno, Italy, June 11-13, 1997, IEEE, pp. 21-29, doi:10.1109/SEQUEN.1997.666900, archivado desde el original el 31 de enero de 2015, consultado el 19 de diciembre de 2014 ..
Broder, Andrei Z.; Charikar, Moses; Frieze, Alan M.; Mitzenmacher, Michael (1998), «Min-wise independent permutations», Proc. 30th ACM Symposium on Theory of Computing (STOC '98), New York, NY, USA: Association for Computing Machinery, pp. 327-336, doi:10.1145/276698.276781 ..
Matoušek, Jiří; Stojaković, Miloš (2003), «On restricted min-wise independence of permutations», Random Structures and Algorithms 23 (4): 397-408, doi:10.1002/rsa.10101 ..
Saks, M.; Srinivasan, A.; Zhou, S.; Zuckerman, D. (2000), «Low discrepancy sets yield approximate min-wise independent permutation families», Information Processing Letters 73 (1–2): 29-32, doi:10.1016/S0020-0190(99)00163-5 ..
Chum, Ondřej; Philbin, James; Isard, Michael; Zisserman, Andrew (2007), «Scalable near identical image and shot detection», Proceedings of the 6th ACM International Conference on Image and Cideo Retrieval (CIVR'07), doi:10.1145/1282280.1282359 .
Cohen, E.; Datar, M.; Fujiwara, S.; Gionis, A.; Indyk, P.; Motwani, R.; Ullman, J. D.; Yang, C. (2001), «Finding interesting associations without support pruning», IEEE Transactions on Knowledge and Data Engineering 13 (1): 64-78, doi:10.1109/69.908981 ..
Andoni, Alexandr; Indyk, Piotr (2008), «Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions», Communications of the ACM 51 (1): 117-122, doi:10.1145/1327452.1327494 ..

epfl.ch

infoscience.epfl.ch

Henzinger, Monika (2006), «Finding near-duplicate web pages: a large-scale evaluation of algorithms», Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval. ACM .

web.archive.org

Broder, Andrei Z. (1997), «On the resemblance and containment of documents», Compression and Complexity of Sequences: Proceedings, Positano, Amalfitan Coast, Salerno, Italy, June 11-13, 1997, IEEE, pp. 21-29, doi:10.1109/SEQUEN.1997.666900, archivado desde el original el 31 de enero de 2015, consultado el 19 de diciembre de 2014 ..
Chum, Ondřej; Philbin, James; Zisserman, Andrew (2008), «Near duplicate image detection: min-hash and tf-idf weighting», Proceedings of the British Machine Vision Conference 3, p. 4, archivado desde el original el 24 de febrero de 2021, consultado el 19 de diciembre de 2014 ..