Radix Trees, Transactions, and MemDBThe talk will introduces the radix tree data structure, it's properties and use cases. Immutable radix trees are shown, with their advantages and constr…
asmyczek/java-zipper · GitHub - Zipper data structure for Java
Let us start with a simple Node and Leaf class: // Node public class Node implements IZipNode { private String name; private final List<Node> children; public Node(final String name, final Node... children) { super(); assert(name != null); assert(children != null); this.name = name; this.children = Arrays.asList(children); } public String getName() { return name; } public Collection<Node> getChild
Tree-like Constant Database (tcdb)
Tree-like Constant Database, or tcdb, is an extension to D. J. Bernstein's cdb file format. tcdb is a hash table that can contain a tree structure whose edges and nodes can be represented as key/value pairs. tcdb is suitable to represent directory structures or sparse matrices. tcdb is also suitable for storing a large number of key/value pairs that have common prefix. Like an original cdb file, a
algorithm - 基数木 + 平衡二分探索木 = 三分探索木 : 404 Blog Not Found
2012å¹´01月22æ—¥16:36 カテゴリアルゴリズム百é¸ç¿»è¨³/紹介 algorithm - 基数木 + 平衡二分探索木 = 三分探索木 ç 玉ã®ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚° Jon Bentley /å°æž—å¥ä¸€éƒŽè¨³ 最有力候補ã¯ã€ã“ã‚Œã‹ã‚‚。 Ternary search tree - Wikipedia, the free encyclopedia 三分探索木 - Wikipedia 404 Blog Not Found:algorithm - Patricia Trie (Radix Trie) ã‚’ JavaScript ã§æœ€è¿‘ã®Trieç ”ç©¶ã®å‚¾å‘ã¯ã€è¦ç´ ã®å‹•çš„変更ãŒè‡ªåœ¨ã«ã§ãる一般å‘ã‘ã®ã‚‚ã®ã§ã¯ãªãã€ä¸€æ—¦ä½œæˆã—ãŸã‚‰è¦ç´ ã®è¿½åŠ ã¨å‰Šé™¤ãŒå›°é›£ãªä»£ã‚ã‚Šã«ã‚‚ã®ã™ã”ãコンパクトã«ãªã‚‹ã€ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®å¿œç”¨æ‰‹æ®µã®æ–¹ã«åã£ã¦ã„ã‚‹ã¨ç´ 人目ã«æ„Ÿã˜ã‚‹ã®ã§ã™ãŒã€ãã‚ãã‚JudyãŸã‚“ã®ã”ã¨ããƒãƒƒã‚·ãƒ¥ãƒ†ãƒ¼ãƒ–ルã¨ã‚¬ãƒã§é—˜ã†ã¨ã‹ã€é€†
サービス終了ã®ãŠçŸ¥ã‚‰ã›
サービス終了ã®ãŠçŸ¥ã‚‰ã› ã„ã¤ã‚‚Yahoo! JAPANã®ã‚µãƒ¼ãƒ“スをã”利用ã„ãŸã ãèª ã«ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã™ã€‚ ãŠå®¢æ§˜ãŒã‚¢ã‚¯ã‚»ã‚¹ã•ã‚ŒãŸã‚µãƒ¼ãƒ“スã¯æœ¬æ—¥ã¾ã§ã«ã‚µãƒ¼ãƒ“スを終了ã„ãŸã—ã¾ã—ãŸã€‚ 今後ã¨ã‚‚Yahoo! JAPANã®ã‚µãƒ¼ãƒ“スをã”愛顧ãã ã•ã„ã¾ã™ã‚ˆã†ã€ã‚ˆã‚ã—ããŠé¡˜ã„ã„ãŸã—ã¾ã™ã€‚
Big-O Algorithm Complexity Cheat Sheet (Know Thy Complexities!) @ericdrowell
Hi there! This webpage covers the space and time Big-O complexities of common algorithms used in Computer Science. When preparing for technical interviews in the past, I found myself spending hours crawling the internet putting together the best, average, and worst case complexities for search and sorting algorithms so that I wouldn't be stumped when asked about them. Over the last few years, I
Left-leaning Red-Black Trees - ã‚„ãŸï¼ ã¯ã¦ãªæ—¥è¨˜
ã„ã‚ã„ã‚ãªã¨ã“ã‚ã§å¼•ç”¨ã•ã‚Œã¦ã„ã¾ã™ï¼Žå®Ÿè£…ãŒæ¥½ãªèµ¤é»’木ã§ï¼Œä»¥ä¸‹ã®ã‚¹ãƒ©ã‚¤ãƒ‰ã‚’見れã°ï¼ˆã‚€ã—ã‚，ã»ã¨ã‚“ã©ã‚³ãƒ”ーã™ã‚‹æ„Ÿã˜ã§ï¼‰ï¼Œç°¡å˜ã«å®Ÿè£…ã§ãã¾ã™ï¼Ž è«–æ–‡ http://www.cs.princeton.edu/~rs/talks/LLRB/LLRB.pdf スライド http://www.cs.princeton.edu/~rs/talks/LLRB/RedBlack.pdf 以下ã¯ï¼Œå°‘ã—普通ã˜ã‚ƒãªã„æ„Ÿã˜ã§ï¼Œã¨ã‚Šã‚ãˆãšè¿½åŠ ã®ã¿ã‚’実装ã—ã¦ã¿ãŸã‚‚ã®ã§ã™ï¼Ž64 ビット環境ã ã¨ãƒã‚¤ãƒ³ã‚¿ã«å‰²ã‚Šå½“ã¦ã‚‰ã‚Œã‚‹é ˜åŸŸã‚‚無視ã§ããªã„ã“ã¨ãŒã‚ã£ãŸã‚Šãªã‹ã£ãŸã‚Šï¼Œã¨ã„ã†æ€ã„ãŒåæ˜ ã•ã‚Œã¦ã„ã¾ã™ï¼ŽãŸã ã—，試作å“ãªã®ã§å°‘ã—ã ã‘…． template <typename ValueType, typename IndexType = unsigned, typename LessThanType = less<ValueType>,
Ryan Marcus · UPenn
Ryan Marcus, assistant professor at the University of Pennsylvania. Using machine learning to build the next generation of data systems. ____ __ ___ / __ \__ ______ _____ / |/ /___ _____________ _______ / /_/ / / / / __ `/ __ \ / /|_/ / __ `/ ___/ ___/ / / / ___/ / _, _/ /_/ / /_/ / / / / / / / / /_/ / / / /__/ /_/ (__ ) /_/ |_|\__, /\__,_/_/ /_/ /_/ /_/\__,_/_/ \___/\__,_/____/ /____/ ___ __ ___
Tree Edit Distanceã¨è‡ªç„¶è¨€èªžå‡¦ç†ã¸ã®å¿œç”¨ - Preferred Networks Research & Development
海野ã§ã™ã€‚ã¡ã‚‡ã£ã¨æ™‚é–“ãŒã‚ã„ã¦ã—ã¾ã„ã¾ã—ãŸãŒã€æ˜¨å¹´ã®12月ã«é–‹å‚¬ã•ã‚ŒãŸNTCIR-9ã¨ã„ã†ä¼šè°ã®Recognizing Inference in TExt (RITE)ã¨ã„ã†ã‚¿ã‚¹ã‚¯ã«ã€å‰è·ã®æ–¹ã€…ã¨å…±è‘—ã§å‡ºå ´ã—ã¾ã—ãŸã€‚ Syntactic Difference Based Approach for NTCIR-9 RITE Task. Yuta Tsuboi, Hiroshi Kanayama, Masaki Ohno and Yuya Unno. NTCIR-9, 2011. [pdf] å«æ„関係èªè˜ã¨ã„ã‚れるã“ã®ã‚¿ã‚¹ã‚¯ã¯ã€å¤§é›‘把ã«è¨€ã†ã¨ä¸Žãˆã‚‰ã‚ŒãŸ2ã¤ã®æ–‡ãŒåŒã˜æ„味ã®ã“ã¨ã‚’言ã£ã¦ã„ã‚‹ã‹ã©ã†ã‹åˆ¤å®šã—ãªã•ã„ã¨ã„ã†ã‚¿ã‚¹ã‚¯ã§ã™ï¼ˆåŽ³å¯†ã«ã¯ä¸€æ–¹ã‹ã‚‰ã‚‚ã†ä¸€æ–¹ãŒå¸°çµã§ãã‚‹ã‹ã®åˆ¤å®šã§ã™ï¼‰ã€‚今日ã¯ã€ãã®ä¸ã§ä½¿ã£ãŸTree Edit Distance (TED) ã«ã¤ã„ã¦è§£èª¬ã—ã¾ã™ã€‚ TEDã¯2ã¤ã®é †åºä»˜ã木ãŒ
MARISA: Matching Algorithm with Recursively Implemented StorAge
MARISA: Matching Algorithm with Recursively Implemented StorAge Abstract: Matching Algorithm with Recursively Implemented StorAge (MARISA) 㯠Trie をコンパクトã«è¡¨ç¾ã™ã‚‹ç¨‹åº¦ã®èƒ½åŠ›ã‚’æŒã¤ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã™ï¼Žlibmarisa 㯠MARISA ã‚’ C++ ã§å®Ÿè£…ã—ãŸãƒ©ã‚¤ãƒ–ラリã§ã‚り，MARISA ã«ã‚ˆã‚‹è¾žæ›¸ã‚’構築ã—ãŸã‚Šï¼Œè¾žæ›¸ã‹ã‚‰ã®æ¤œç´¢ã‚’ãŠã“ãªã£ãŸã‚Šã§ãã¾ã™ï¼Žlibmarisa ã®åŸºæœ¬çš„ãªæ©Ÿèƒ½ã«å¯¾å¿œã™ã‚‹ã‚³ãƒžãƒ³ãƒ‰ãƒ©ã‚¤ãƒ³ãƒ„ールを用æ„ã—ã¦ã„ã‚‹ã®ã§ï¼Œè¾žæ›¸ã®ã‚µã‚¤ã‚ºãŒã©ã®ãらã„ã«ãªã‚‹ã®ã‹ï¼Œæ¤œç´¢ã«ã©ã®ãらã„時間ãŒã‹ã‹ã‚‹ã®ã‹ï¼Œãªã©ã‚’手軽ã«è©¦ã™ã“ã¨ãŒã§ãã¾ã™ï¼Ž æ¦‚è¦ Matching Algorithm with Recursively Implemented Stor
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
定兼 邦彦 (Kunihiko Sadakane) - ç°¡æ½”ãƒ‡ãƒ¼ã‚¿æ§‹é€ è¬›ç¾©è³‡æ–™ - researchmap
Google Code Archive - Long-term storage for Google Code Project Hosting.
Text Mining Software - Java Trie Library
PATRICIA Trie — kapsi.(de|eu)
GitHub - rkapsi/simple-patricia-trie: A simple PATRICIA Trie implementation that's more "hackable".
GitHub - rkapsi/patricia-trie: Practical Algorithm to Retrieve Information Coded in Alphanumeric (PATRICIA)
BadgeNow.com is for sale | HugeDomains
Indexed ranged search algorithm for IP Addresses
mapping ipaddress range to country codes (data-structure hashmaps or trees?)
Google Code Archive - Long-term storage for Google Code Project Hosting.
{{#tags}}- {{label}}
{{/tags}}