Sign In

Login

Password

Forgot Password ? Sign Up

트라이 (컴퓨팅) (Korean Wikipedia)

Analysis of information sources in references of the Wikipedia article "트라이 (컴퓨팅)" in Korean language version.

refsWebsite
Global rank Korean rank
6doi.org
2nd place
3rd place
3web.archive.org
1st place
1st place
2unimelb.edu.au
3,221st place
8,254th place
2arxiv.org
69th place
54th place
1archive.org
6th place
18th place
1nist.gov
355th place
172nd place
1ddj.com
low place
2,095th place
1semanticscholar.org
11th place
310th place
1princeton.edu
741st place
281st place
1helsinki.fi
1,670th place
3,904th place
1uzh.ch
3,633rd place
7,734th place
1allisons.org
low place
low place
1ufl.edu
921st place
1,075th place
1oswego.edu
low place
low place
1pg.gda.pl
low place
low place
1mitpressjournals.org
low place
2,475th place
1aclweb.org
low place
low place
1worldcat.org
5th place
11th place

aclweb.org (Global: low place; Korean: low place)

  • Ulrich Germann; Eric Joanis; Samuel Larkin (2009). “Tightly packed tries: how to fit large models into memory, and make them load fast, too” (PDF). 《ACL Workshops: Proceedings of the Workshop on Software Engineering, Testing, and Quality Assurance for Natural Language Processing》. Association for Computational Linguistics. 31–39쪽. We present Tightly Packed Tries (TPTs), a compact implementation of read-only, compressed trie structures with fast on-demand paging and short load times. We demonstrate the benefits of TPTs for storing n-gram back-off language models and phrase tables for statistical machine translation. Encoded as TPTs, these databases require less space than flat text file representations of the same data compressed with the gzip utility. At the same time, they can be mapped into memory quickly and be searched directly in time linear in the length of the key, without the need to decompress the entire file. The overhead for local decompression during search is marginal. 

allisons.org (Global: low place; Korean: low place)

  • Allison, Lloyd. “Tries”. 2014년 2월 18일에 확인함. 

archive.org (Global: 6th place; Korean: 18th place)

arxiv.org (Global: 69th place; Korean: 54th place)

  • Bellekens, Xavier (2014). 〈A Highly-Efficient Memory-Compression Scheme for GPU-Accelerated Intrusion Detection Systems〉. 《Proceedings of the 7th International Conference on Security of Information and Networks - SIN '14》. Glasgow, Scotland, UK: ACM. 302:302–302:309쪽. arXiv:1704.02272. doi:10.1145/2659651.2659723. ISBN 978-1-4503-3033-6. 
  • Jan Daciuk; Stoyan Mihov; Bruce W. Watson; Richard E. Watson (2000). “Incremental Construction of Minimal Acyclic Finite-State Automata”. 《Computational Linguistics》 (Association for Computational Linguistics) 26: 3–16. arXiv:cs/0007009. doi:10.1162/089120100561601. 2011년 9월 30일에 원본 문서에서 보존된 문서. 2009년 5월 28일에 확인함. This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly  Alt URL

ddj.com (Global: low place; Korean: 2,095th place)

doi.org (Global: 2nd place; Korean: 3rd place)

dx.doi.org

helsinki.fi (Global: 1,670th place; Korean: 3,904th place)

cs.helsinki.fi

  • Kärkkäinen, Juha. “Lecture 2” (PDF). University of Helsinki. The preorder of the nodes in a trie is the same as the lexicographical order of the strings they represent assuming the children of a node are ordered by the edge labels. 

mitpressjournals.org (Global: low place; Korean: 2,475th place)

  • Jan Daciuk; Stoyan Mihov; Bruce W. Watson; Richard E. Watson (2000). “Incremental Construction of Minimal Acyclic Finite-State Automata”. 《Computational Linguistics》 (Association for Computational Linguistics) 26: 3–16. arXiv:cs/0007009. doi:10.1162/089120100561601. 2011년 9월 30일에 원본 문서에서 보존된 문서. 2009년 5월 28일에 확인함. This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly  Alt URL

nist.gov (Global: 355th place; Korean: 172nd place)

xlinux.nist.gov

oswego.edu (Global: low place; Korean: low place)

gee.cs.oswego.edu

pg.gda.pl (Global: low place; Korean: low place)

  • Jan Daciuk; Stoyan Mihov; Bruce W. Watson; Richard E. Watson (2000). “Incremental Construction of Minimal Acyclic Finite-State Automata”. 《Computational Linguistics》 (Association for Computational Linguistics) 26: 3–16. arXiv:cs/0007009. doi:10.1162/089120100561601. 2011년 9월 30일에 원본 문서에서 보존된 문서. 2009년 5월 28일에 확인함. This paper presents a method for direct building of minimal acyclic finite states automaton which recognizes a given finite list of words in lexicographical order. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the resulting automaton on-the-fly  Alt URL

princeton.edu (Global: 741st place; Korean: 281st place)

algs4.cs.princeton.edu

  • Sedgewick, Robert; Wayne, Kevin (2020년 6월 12일). “Tries”. 《algs4.cs.princeton.edu》. 2020년 8월 11일에 확인함. 

semanticscholar.org (Global: 11th place; Korean: 310th place)

pdfs.semanticscholar.org

ufl.edu (Global: 921st place; Korean: 1,075th place)

cise.ufl.edu

  • Sahni, Sartaj. “Tries”. 《Data Structures, Algorithms, & Applications in Java》. University of Florida. 2014년 2월 18일에 확인함. 

unimelb.edu.au (Global: 3,221st place; Korean: 8,254th place)

people.eng.unimelb.edu.au

uzh.ch (Global: 3,633rd place; Korean: 7,734th place)

ifi.uzh.ch

web.archive.org (Global: 1st place; Korean: 1st place)

worldcat.org (Global: 5th place; Korean: 11th place)