Hashing sensível à localidade (Portuguese Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hashing sensível à localidade" in Portuguese language version.

refsWebsite

Global rank Portuguese rank

14doi.org

2^nd place

4^th place

6psu.edu

207^th place

589^th place

3arxiv.org

69^th place

195^th place

2github.com

383^rd place

814^th place

2mit.edu

415^th place

453^rd place

1stanford.edu

179^th place

198^th place

1aaai.org

9,352^nd place

low place

1worldcat.org

5^th place

1perma.cc

low place

1unclaw.com

low place

1jyu.fi

8,864^th place

low place

1nih.gov

4^th place

8^th place

1openreview.net

low place

1academia.edu

121^st place

131^st place

1unimi.it

9,889^th place

low place

1inria.fr

4,903^rd place

low place

1elsevier.com

610^th place

360^th place

1aclanthology.org

low place

aaai.org

ojs.aaai.org

Zhao, Kang; Lu, Hongtao; Mei, Jincheng (2014). Locality Preserving Hashing. AAAI Conference on Artificial Intelligence. 28. pp. 2874–2880

academia.edu

Oliver, Jonathan; Cheng, Chun; Chen, Yanggui (2013). TLSH - a locality sensitive hash. ISBN 978-1-4799-3076-0. doi:10.1109/CTC.2013.9

aclanthology.org

Gorman, James, and James R. Curran. "Scaling distributional similarity to large corpora." Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics. Association for Computational Linguistics, 2006.

arxiv.org

Chen, Beidi; Medini, Tharun (29 de fevereiro de 2020). «SLIDE : In Defense of Smart Algorithms over Hardware Acceleration for Large-Scale Deep Learning Systems». arXiv:1903.03129 [cs.DC]
Dahlgaard, Søren, Mathias Bæk Tejs Knudsen, and Mikkel Thorup. "Fast similarity sketching." 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2017.
Christiani, Tobias. "Fast locality-sensitive hashing frameworks for approximate near neighbor search." International Conference on Similarity Search and Applications. Springer, Cham, 2019.

doi.org

dx.doi.org

Tsai, Yi-Hsuan; Yang, Ming-Hsuan (outubro de 2014). «Locality preserving hashing». 2014 IEEE International Conference on Image Processing (ICIP). [S.l.: s.n.] pp. 2988–2992. ISBN 978-1-4799-5751-4. ISSN 1522-4880. doi:10.1109/ICIP.2014.7025604
Charikar, Moses S. (2002). Proceedings of the 34th Annual ACM Symposium on Theory of Computing. pp. 380–388. CiteSeerX 10.1.1.147.4064. doi:10.1145/509907.509965
Chin, Andrew (1994). «Locality-Preserving Hash Functions for General Purpose Parallel Computation» (PDF). Algorithmica. 12 (2-3): 170-181. doi:10.1007/BF01185209
Das, Abhinandan S.; et al. (2007), «Google news personalization: scalable online collaborative filtering», ISBN 9781595936547, Proceedings of the 16th International Conference on World Wide Web, doi:10.1145/1242572.1242610 .
Koga, Hisashi; Tetsuo Ishibashi; Toshinori Watanabe (2007), «Fast agglomerative hierarchical clustering algorithm using Locality-Sensitive Hashing», Knowledge and Information Systems, 12 (1): 25–53, doi:10.1007/s10115-006-0027-5 .
Cochez, Michael; Mou, Hao (2015), «Twister Tries: Approximate Hierarchical Agglomerative Clustering for Average Distance in Linear Time» (PDF), ISBN 9781450327589, Proceeding SIGMOD '15 Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data: 505–517, doi:10.1145/2723372.2751521 .
Brinza, Dumitru; et al. (2010), «RAPID detection of gene–gene interactions in genome-wide association studies», Bioinformatics, 26 (22): 2856–2862, PMC 3493125, PMID 20871107, doi:10.1093/bioinformatics/btq529
Aluç, Güneş; Özsu, M. Tamer; Daudjee, Khuzaima (2018), «Building self-clustering RDF databases using Tunable-LSH», The VLDB Journal, 28 (2): 173–195, doi:10.1007/s00778-018-0530-9
Oliver, Jonathan; Cheng, Chun; Chen, Yanggui (2013). TLSH - a locality sensitive hash. ISBN 978-1-4799-3076-0. doi:10.1109/CTC.2013.9
Broder, A.Z.; Charikar, M.; Frieze, A.M.; Mitzenmacher, M. (1998). Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. pp. 327–336. CiteSeerX 10.1.1.409.9220. doi:10.1145/276698.276781 |acessodata= requer |url= (ajuda)
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. CiteSeerX 10.1.1.20.8264. doi:10.1016/S0020-0190(99)00163-5. Consultado em 14 de novembro de 2007
Alexandr Andoni; Indyk, P. (2008). «Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions». Communications of the ACM. 51 (1): 117–122. CiteSeerX 10.1.1.226.6905. doi:10.1145/1327452.1327494
Pauleve, L.; Jegou, H.; Amsaleg, L. (2010). «Locality sensitive hashing: A comparison of hash function types and querying mechanisms». Pattern Recognition Letters. 31 (11): 1348–1358. doi:10.1016/j.patrec.2010.04.004
Salakhutdinov, Ruslan; Hinton, Geoffrey (2008). «Semantic hashing». International Journal of Approximate Reasoning (em inglês). 50 (7): 969–978. doi:10.1016/j.ijar.2008.11.006

elsevier.com

linkinghub.elsevier.com

Salakhutdinov, Ruslan; Hinton, Geoffrey (2008). «Semantic hashing». International Journal of Approximate Reasoning (em inglês). 50 (7): 969–978. doi:10.1016/j.ijar.2008.11.006

github.com

dejavu - Audio fingerprinting and recognition in Python, 19 de dezembro de 2018
«TLSH». Consultado em 10 de abril de 2014

inria.fr

hal.inria.fr

Pauleve, L.; Jegou, H.; Amsaleg, L. (2010). «Locality sensitive hashing: A comparison of hash function types and querying mechanisms». Pattern Recognition Letters. 31 (11): 1348–1358. doi:10.1016/j.patrec.2010.04.004

jyu.fi

jyx.jyu.fi

Cochez, Michael; Mou, Hao (2015), «Twister Tries: Approximate Hierarchical Agglomerative Clustering for Average Distance in Linear Time» (PDF), ISBN 9781450327589, Proceeding SIGMOD '15 Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data: 505–517, doi:10.1145/2723372.2751521 .

mit.edu

people.csail.mit.edu

Gionis, A.; Indyk, P.; Motwani, R. (1999). «Similarity Search in High Dimensions via Hashing». Proceedings of the 25th Very Large Database (VLDB) Conference

theory.csail.mit.edu

Datar, M.; Immorlica, N.; Indyk, P.; Mirrokni, V.S. (2004). «Locality-Sensitive Hashing Scheme Based on p-Stable Distributions». Proceedings of the Symposium on Computational Geometry

nih.gov

ncbi.nlm.nih.gov

Brinza, Dumitru; et al. (2010), «RAPID detection of gene–gene interactions in genome-wide association studies», Bioinformatics, 26 (22): 2856–2862, PMC 3493125, PMID 20871107, doi:10.1093/bioinformatics/btq529

openreview.net

Chen, Beidi; Liu, Zichang; Peng, Binghui; Xu, Zhaozhuo; Li, Jonathan Lingjie; Dao, Tri; Song, Zhao; Shrivastava, Anshumali; Re, Christopher (2021), «MONGOOSE: A Learnable LSH Framework for Efficient Neural Network Training», International Conference on Learning Representation

perma.cc

Chin, Andrew. Complexity Issues in General Purpose Parallel Computing (DPhil)

psu.edu

citeseerx.ist.psu.edu

Charikar, Moses S. (2002). Proceedings of the 34th Annual ACM Symposium on Theory of Computing. pp. 380–388. CiteSeerX 10.1.1.147.4064. doi:10.1145/509907.509965
Broder, A.Z.; Charikar, M.; Frieze, A.M.; Mitzenmacher, M. (1998). Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing. pp. 327–336. CiteSeerX 10.1.1.409.9220. doi:10.1145/276698.276781 |acessodata= requer |url= (ajuda)
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. CiteSeerX 10.1.1.20.8264. doi:10.1016/S0020-0190(99)00163-5. Consultado em 14 de novembro de 2007
Alexandr Andoni; Indyk, P. (2008). «Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions». Communications of the ACM. 51 (1): 117–122. CiteSeerX 10.1.1.226.6905. doi:10.1145/1327452.1327494

citeseer.ist.psu.edu

Matoušek, J.; Stojakovic, M. (2002). «On Restricted Min-Wise Independence of Permutations». Preprint. Consultado em 14 de novembro de 2007
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. CiteSeerX 10.1.1.20.8264. doi:10.1016/S0020-0190(99)00163-5. Consultado em 14 de novembro de 2007

stanford.edu

infolab.stanford.edu

Rajaraman, A.; Ullman, J. (2010). «Mining of Massive Datasets, Ch. 3.»

unclaw.com

Chin, Andrew (1994). «Locality-Preserving Hash Functions for General Purpose Parallel Computation» (PDF). Algorithmica. 12 (2-3): 170-181. doi:10.1007/BF01185209

unimi.it

spdp.di.unimi.it

Damiani; et al. (2004). «An Open Digest-based Technique for Spam Detection» (PDF). Consultado em 1 de setembro de 2013

worldcat.org

Tsai, Yi-Hsuan; Yang, Ming-Hsuan (outubro de 2014). «Locality preserving hashing». 2014 IEEE International Conference on Image Processing (ICIP). [S.l.: s.n.] pp. 2988–2992. ISBN 978-1-4799-5751-4. ISSN 1522-4880. doi:10.1109/ICIP.2014.7025604