[B! algorithm] limingã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

liming id:liming

algorithmã«é–¢ã™ã‚‹limingã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (8)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

Algorithm Database
ç„¡å‘ã‚°ãƒ©ãƒ• ã‚¹ã‚±ã‚¸ãƒ¥ãƒ¼ãƒªãƒ³ã‚° é‡åè¨ˆç®—ï¼ˆã‚°ãƒãƒ¼ãƒãƒ¼ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ï¼‰ æœ€å°ã‚«ãƒƒãƒˆ æŠ•ç¥¨åŠ›æŒ‡æ•° (CGI) ãƒãƒ£ãƒãƒ«å‰²å½“å•é¡Œ å…±æœ‰åŒºé–“åˆ—æŒ™å•é¡Œ(CGI) ï¼’æ¬¡å…ƒãƒœãƒãƒŽã‚¤å›³æ§‹æˆ ã‚°ãƒ©ãƒ•ã‚¨ãƒ‡ã‚£ã‚¿ã®ä½œæˆï¼ˆç¾¤é¦¬å¤§å¦ ä¸é‡Žç ”ç©¶å®¤ï¼‰ è¾ºé€£çµåº¦å¢—å¤§ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ï¼“æ¬¡å…ƒå‡¸åŒ… ã‚°ãƒ©ãƒ•åˆ†å‰²å•é¡Œ æœ€å¤§ã‚¯ãƒªãƒ¼ã‚¯å•é¡Œ å·¡å›žã‚»ãƒ¼ãƒ«ã‚¹ãƒžãƒ³å•é¡Œ æœ€çŸè·¯å•é¡Œ ãƒã‚¤ãƒ‘ãƒ¼ã‚°ãƒ©ãƒ•ã®æ¥µå°æ¨ªæ– new!!èª¤å·®æ‹¡æ•£æ³• ï¼ˆãƒ–ãƒ©ã‚¦ã‚¶ã®è¨å®šã§ "Javaã‚’æœ‰åŠ¹" ã«ã—ã¦ä¸‹ã•ã„ã€‚ï¼‰
liming 2010/08/22
algorithm

math

education

graph
ãƒªãƒ³ã‚¯
Trie
ãƒˆãƒ©ã‚¤ï¼ˆ Trie ï¼‰ã¨ã¯ï¼Œ è‡ªç„¶è¨€èªžå‡¦ç†ã‚„ã‚³ãƒ³ãƒ‘ã‚¤ãƒ©ï¼Œãƒ•ã‚£ãƒ«ã‚¿ãƒªãƒ³ã‚°ãªã©ã«ç”¨ã„ã‚‰ã‚Œã¦ã„ã‚‹æœ¨æ§‹é€ ã§ã™ï¼Ž äºŒåˆ†æŽ¢ç´¢æœ¨ãªã©ã¨ã¯ç•°ãªã‚Šï¼Œæ–‡å—å˜ä½ã§æŽ¢ç´¢ãŒé€²è¡Œã™ã‚‹ã®ã§ï¼Œ å…¥åŠ›æ–‡å—åˆ—ã®å‰æ–¹éƒ¨åˆ†ã¨ä¸€è‡´ã™ã‚‹ã‚ãƒ¼ã‚’åˆ—æŒ™ã—ãŸã‚Šï¼Œ ã©ã®æ–‡å—ã¾ã§æŽ¢ç´¢ã«æˆåŠŸã—ã¦ã„ãŸã‹ã¨ã„ã†æƒ…å ±ã‚’å–å¾—ã—ãŸã‚Šã§ãã¾ã™ï¼Ž ã¾ãŸï¼Œã‚ãƒ¼æ•°ã®å¢—åŠ ã«ã‚ˆã£ã¦æ¤œç´¢é€Ÿåº¦ãŒé…ããªã‚Šã«ãã„ã¨ã„ã†ç‰¹å¾´ã‚‚ã‚ã‚Šã¾ã™ï¼Ž ãƒˆãƒ©ã‚¤ã¯æ–‡å—åˆ—ã‚’æ ¼ç´ã™ã‚‹ã®ã«é©ã—ãŸæœ¨æ§‹é€ ã§ã™ï¼Ž ãƒˆãƒ©ã‚¤ã®ç¯€ï¼ˆ Node ï¼‰ã‚ã‚‹ã„ã¯ æžï¼ˆ Arc ï¼‰ã«ã¯ æ–‡å—ãŒä»˜ä¸Žã•ã‚Œã¦ã„ã¦ï¼ˆ Label ï¼‰ï¼Œ æ ¹ï¼ˆ Root ï¼‰ã‹ã‚‰ è‘‰ï¼ˆ Leaf ï¼‰ã¸ã® çµŒè·¯ï¼ˆ Path ï¼‰ä¸Šã®æ–‡å—ã‚’é€£çµã™ã‚‹ã“ã¨ã«ã‚ˆã‚Šï¼Œ ç™»éŒ²ã•ã‚Œã¦ã„ã‚‹æ–‡å—åˆ—ã‚’å¾©å…ƒã™ã‚‹ã“ã¨ãŒã§ãã¾ã™ï¼Ž ä¾‹ãˆã°ï¼Œä¸‰ã¤ã®æ–‡å—åˆ— "bird", "bison", "cat" ã‚’ç™»éŒ²ã—ãŸãƒˆãƒ©ã‚¤ã¯ä»¥ä¸‹ã®ã‚ˆã†ã«ãªã‚Šã¾ã™ï¼Ž å›³ä¸ã®ç¯€ã«ã¤ã„ã¦ã„ã‚‹ç•ªå·ã¯ï¼Œã™ã¹ã¦ã®ç¯€ã‚’ä¸€
liming 2010/07/19
software design

algorithm

trie
ãƒªãƒ³ã‚¯
start [strchr.com]
How to find words by their prefix, which can be mistyped, and sort them by frequency stored with the word. 12Â years ago IntelÂ® Architecture Instruction Set Extensions Programming Reference (PDF reference). The description of new instructions in the upcoming Haswell processor, including transactional memory support, hardware random number generator, and 256-bit vector integer operations. The transa
liming 2009/08/01
algorithm

programming

tips
ãƒªãƒ³ã‚¯
ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ‡ãƒ¼ã‚·ãƒ§ãƒ³ã¨ã‚¨ãƒ‡ã‚£ãƒƒãƒˆã‚°ãƒ©ãƒ•
ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ‡ãƒ¼ã‚·ãƒ§ãƒ³ã¨ã‚¨ãƒ‡ã‚£ãƒƒãƒˆã‚°ãƒ©ãƒ•ï¼šã‚³ãƒ¼ãƒ‡ã‚£ãƒ³ã‚°ã«å½¹ç«‹ã¤ï¼ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®åŸºæœ¬ï¼ˆ10ï¼‰ï¼ˆ1/4 ãƒšãƒ¼ã‚¸ï¼‰ ãƒ—ãƒã‚°ãƒ©ãƒžãŸã‚‹ã‚‚ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¯çŸ¥ã£ã¦ã„ã¦å½“ç„¶ã®çŸ¥è˜ã§ã™ã€‚ã—ã‹ã—ã€æ•™ç§‘æ›¸çš„ãªçŸ¥è˜ã—ã‹çŸ¥ã‚‰ãªãã¦ã€å®Ÿè·µçš„ãªãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã«å½¹ç«‹ã¦ã‚‹ã“ã¨ãŒã§ãã‚‹ã§ã—ã‚‡ã†ã‹ï¼ˆç·¨é›†éƒ¨ï¼‰ å®Ÿéš›ã®ã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³ã§ä½¿ã‚ã‚Œã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã“ã‚Œã¾ã§è¦‹ã¦ããŸã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ã€å®Ÿéš›ã®ã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³é–‹ç™ºã®éš›ã«ãã®ã¾ã¾ä½¿ã‚ã‚Œã‚‹ã“ã¨ã¯ã‚ã¾ã‚Šãªãã€ãƒ—ãƒã‚°ãƒ©ãƒ è¨€èªžã‚„ãƒ©ã‚¤ãƒ–ãƒ©ãƒªãªã©ã§ã™ã§ã«æ©Ÿèƒ½ãŒç”¨æ„ã•ã‚Œã¦ã„ã‚‹ã‚‚ã®ãŒå¤§åŠã§ã—ãŸã€‚ ä»Šå›žã¯æœ€çµ‚å›žã¨ã„ã†ã“ã¨ã§ã€å®Ÿéš›ã®ã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³é–‹ç™ºã§ãã®ã¾ã¾ä½¿ãˆã‚‹ã‚‚ã®ã‚’ç´¹ä»‹ã—ãŸã„ã¨æ€ã„ã¾ã™ã€‚ ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ‡ãƒ¼ã‚·ãƒ§ãƒ³ ECã‚µã‚¤ãƒˆã§ã€ã€Œã‚ãªãŸã«ãŠå‹§ã‚ã®å•†å“ã€ã‚’è¡¨ç¤ºã—ã¦ã„ã‚‹ã“ã¨ãŒã‚ã‚Šã¾ã™ã€‚ã„ã‚ã„ã‚ãªãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã‚„è¡Œå‹•å±¥æ´ã®ãƒ‡ãƒ¼ã‚¿ã‹ã‚‰ã€ãã®äººã”ã¨ã«ãŠå‹§ã‚ã®å•†å“ã‚’ã¯ã˜ãå‡ºã—ã¦æŽ¨è–¦ã™ã‚‹æ©Ÿèƒ½ã‚’ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ‡ãƒ¼
liming 2009/05/06
recommendation

edit graph

algorithm
ãƒªãƒ³ã‚¯
Darts: Double ARray Trie System
Darts: Double-ARray Trie System ã¯ã˜ã‚ã« Darts ã¯, Double-Array [Aoe 1989]ã‚’æ§‹ç¯‰ã™ã‚‹ãŸã‚ã® ã‚·ãƒ³ãƒ—ãƒ«ãª C++ Template Library ã§ã™. Double-Array ã¯ Trie ã‚’è¡¨ç¾ã™ã‚‹ãŸã‚ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã™. ãƒãƒƒã‚·ãƒ¥æœ¨, ãƒ‡ã‚¸ã‚¿ãƒ«ãƒˆãƒ©ã‚¤, ãƒ‘ãƒˆãƒªã‚·ã‚¢æœ¨, Suffix Array ã«ã‚ˆã‚‹æ“¬ä¼¼ Trieã¨ã„ã£ãŸ ä»–ã® Trie ã®å®Ÿè£…ã«æ¯”ã¹é«˜é€Ÿã«å‹•ä½œã—ã¾ã™. ã‚ªãƒªã‚¸ãƒŠãƒ« ã® Double-Arrayã¯, å‹•çš„ã« key ã®è¿½åŠ å‰Šé™¤ã‚’è¡Œãˆã‚‹ã‚ˆã†ãª æž çµ„ã§ã™ãŒ, Darts ã¯ ã‚½ãƒ¼ãƒˆæ¸ˆã®è¾žæ›¸ã‚’ä¸€æ‹¬ã—ã¦Double-Array ã«å¤‰æ›ã™ã‚‹ã“ã¨ã«æ©Ÿèƒ½ã‚’çµžã£ã¦ã„ã¾ã™. ãƒãƒƒã‚·ãƒ¥ã®ã‚ˆã†ãªå˜ç´”ãªè¾žæ›¸ã¨ã—ã¦ä½¿ã†ã“ã¨ã‚‚å¯èƒ½ã§ã™ãŒ, å½¢æ…‹ç´ è§£æžå™¨ã®è¾žæ›¸ã«å¿…é ˆã® Common Prefix Search ã‚’éžå¸¸ã«é«˜é€Ÿã«è¡Œã†ã“ã¨ãŒ
liming 2009/05/02
Double Arrayã‚’C++ã§å®Ÿç¾ã™ã‚‹ãŸã‚ã®template library

algorithm

trie

double array

Darts

programming

ChaSen

MeCab
ãƒªãƒ³ã‚¯
Double-Array
ãƒ€ãƒ–ãƒ«é…åˆ—ï¼ˆ Double-Array ï¼‰ã¯ï¼Œ ãƒˆãƒ©ã‚¤ï¼ˆ Trie ï¼‰ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®ä¸€ç¨®ã§ã‚ã‚Šï¼Œ å°ã•ã„è¾žæ›¸ã§é«˜é€Ÿã«æ¤œç´¢ã§ãã‚‹ã¨ã„ã†ç‰¹é•·ã‚’æŒã£ã¦ã„ã¾ã™ï¼Ž å®Ÿéš›ã«ï¼ŒèŒ¶çŒï¼ˆ ChaSen ï¼‰ã‚„ å’Œå¸ƒè•ªï¼ˆ MeCab ï¼‰ãªã©ã® å½¢æ…‹ç´ è§£æžå™¨ã§åˆ©ç”¨ã•ã‚Œã¦ã„ã‚‹ã¨ã„ã†å®Ÿç¸¾ãŒã‚ã‚Šã¾ã™ï¼Ž ãƒ€ãƒ–ãƒ«é…åˆ—ã§ã¯ï¼Œé…åˆ—ã‚’ä½¿ã£ã¦ãƒˆãƒ©ã‚¤ã‚’è¡¨ç¾ã—ã¾ã™ï¼Ž é…åˆ—ã®å„è¦ç´ ãŒ BASE, CHECK ã¨ã„ã†äºŒã¤ã®æ•´æ•°ã‚’æŒã¤ã®ã§ï¼Œé æ–‡å—ã‚’ã¨ã£ã¦é…åˆ— BC ã¨å‘¼ã¶ã“ã¨ã«ã—ã¾ã™ï¼Ž ä»¥é™ã®èª¬æ˜Žã§ã¯ï¼Œé…åˆ— BC ã®è¦ç´ x ã® BASE, CHECK ã‚’ ãã‚Œãžã‚Œ BC[x].BASE, BC[x].CHECK ã¨è¨˜è¿°ã—ã¾ã™ï¼Ž é€šå¸¸ï¼ŒBASE, CHECK ã¯å€‹åˆ¥ã®é…åˆ—ã¨ã—ã¦ç´¹ä»‹ã•ã‚Œã¾ã™ãŒï¼Œ ç‰¹ã«åˆ†å‰²ã—ã¦è€ƒãˆã‚‹å¿…è¦ãŒãªã„ã®ã§ï¼Œã“ã®ã‚ˆã†ãªèª¬æ˜Žã«ã—ã¾ã—ãŸï¼Ž åŸºæœ¬çš„ã«ï¼Œé…åˆ— BC ã®å„è¦ç´ ã¯ ãƒˆãƒ©ã‚¤ã®ç¯€ã¨ä¸€å¯¾ä¸€ã§å¯¾å¿œã—ã¾ã™ï¼Ž ãã®ãŸã‚ï¼Œå¯¾å¿œã™ã‚‹
liming 2009/05/02
Trieã‚’åŠ¹çŽ‡çš„ã«å®Ÿè£…ã™ã‚‹æ–¹æ³•

algorithm

trie

double array

programming
ãƒªãƒ³ã‚¯
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚¤ãƒ³ãƒˆãƒãƒ€ã‚¯ã‚·ãƒ§ãƒ³15ç« å‹•çš„è¨ˆç”»æ³•
3. å‹•çš„è¨ˆç”»æ³•ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ æœ€é©è§£ ã® æ§‹é€ ã‚’ ç‰¹å¾´ ã¥ã‘ã‚‹ æœ€é©è§£ ã® å€¤ ã‚’ å†å¸°çš„ ã« å®šç¾© ã™ã‚‹ ãƒœãƒˆãƒ ã‚¢ãƒƒãƒ— ã« æœ€é©è§£ ã® å€¤ ã‚’ æ±‚ ã‚ã‚‹ æœ€é©è§£ ã‚’ æ§‹æˆ ã™ã‚‹
liming 2009/04/24
programming

algorithm

dynamic programming

presentation

education
ãƒªãƒ³ã‚¯
æ—¥æœ¬Javaãƒ¦ãƒ¼ã‚¶ãƒ¼ã‚°ãƒ«ãƒ¼ãƒ—
æ—¥æœ¬Javaãƒ¦ãƒ¼ã‚¶ãƒ¼ã‚°ãƒ«ãƒ¼ãƒ—ã¯Java æŠ€è¡“ã®å‘ä¸Šãƒ»ç™ºå±•ã¨ä¸€å±¤ã®æ™®åŠãƒ»æ´»æ€§åŒ–ã‚’ç›®æŒ‡ã™ä»»æ„å›£ä½“ã§ã™ã€‚è©³ã—ãã¯ã“ã¡ã‚‰ã‹ã‚‰ã€‚
liming 2008/07/01
Googleã®å¤§è¦æ¨¡ä¸¦åˆ—å‡¦ç†ã®æ ¹æœ¬åŽŸç†ã‚’ç°¡æ˜Žã«è§£èª¬

Google

MapReduce

algorithm
ãƒªãƒ³ã‚¯
1