[B! naoya] mechairoiã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

mechairoi id:mechairoi

naoyaã«é–¢ã™ã‚‹mechairoiã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (5)

${{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}}

ã‚»ã‚ãƒ¥ãƒªãƒ†ã‚£ï¼†ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚ãƒ£ãƒ³ãƒ—2025ã«å¯„ã›ã‚‰ã‚ŒãŸç§‘å¦æŠ€è¡“åºé•·å®˜ã®ç¥è¾ž - ITæˆ¦è¨˜
ãƒã‚¿ã§ã™ï¼ ç¥è¾ž ã“ã®æ–‡ç« ã‚’èªã¿å§‹ã‚ãŸè«¸å›ã€èªã‚€ã®ã‚’ã‚„ã‚ã¦ç›®ã‚’é–‰ã˜ã¦ã»ã—ã„ã€‚ ç›®ã‚’é–‰ã˜ãŸã‚‰æ€ã„å‡ºã—ã¦ã»ã—ã„ã€‚ ã¾ã å¹¼ã„é ƒã®å›ãŸã¡ã¯ã€ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ã¨ã¨ã‚‚ã«ã‚ã£ãŸã‹ã€‚ ä»Šæ€ã„å‡ºã—ãŸã€Œå½“æ™‚ã®è«¸å›ãŒåˆã‚ã¦èµ·å‹•ã—ãŸã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ã®ç”»é¢ã€ã€‚ ãã‚ŒãŒã€ã¾ã¶ãŸã®è£ã«ã‚ˆã¿ãŒãˆã‚‹ã ã‚ã†ã‹ã€‚ ãã‚Œã‹ã‚‰è«¸å›ãŒå§‹ã‚ã¦èµ·å‹•ã—ãŸã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã‚’æ€ã„å‡ºãã†ã€‚ ã„ã¤ã€ä½•æ³ãã‚‰ã„ã®ã¨ãã€ä½•ã‚’ã€ã©ã“ã§ä½¿ã£ãŸã ã‚ã†ã‹ã€‚ ãã®ã¨ãèµ·å‹•ã—ãŸã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã¯ä½•ï¼Ÿã€€ã‚²ãƒ¼ãƒ ã‹ã€ãã‚Œã¨ã‚‚ã‚¦ã‚§ãƒ–ãƒ–ãƒ©ã‚¦ã‚¶ã‹ã€‚ ãã‚Œã‚’è«¸å›ã¯ãã£ã¨è¦šãˆã¦ã„ã‚‹ã€‚ æ€ã„å‡ºã™ã“ã¨ãŒã§ãã‚‹ã¯ãšã ã€‚ã ã‹ã‚‰ã„ã¾ã€ç›®ã‚’é–‰ã˜ã¦ã¿ã‚ˆã†ã€‚ ãŸã£ãŸã„ã¾ã€è«¸å›ãŒç›®ã®å¥¥ã«ç™ºè¦‹ã—ãŸã‚‚ã®ã€ãã‚Œã“ããŒã€Œè‡ªåˆ†ã€ã ã€‚ ã“ã‚Œã‹ã‚‰æ§˜ã€…ãªäººã¨å‡ºä¼šã„ã€è‡ªåˆ†ã‚’è¦‹å¤±ã†ã¨ããŒæ¥ã‚‹ã‹ã‚‚ã—ã‚Œãªã„ã€‚ ãã®æ™‚ã¯ç›®ã‚’ã¤ã¶ã‚‹ã¨ã„ã„ã€‚ ã™ã‚‹ã¨å›ãŸã¡ã®ã¾ã¶ãŸã®è£ã«ã€è‡ªåˆ†ã®å§¿ãŒã‚ˆã¿ãŒãˆã‚‹ã€‚ ãã®ã¨ãã€è«¸å›ãŒä»–ã®å‹äººé”ã¨é•ã†ã¨ã—ãŸã‚‰ã€ å¿…
mechairoi 2009/12/13
ãƒã‚¿

ãƒã‚¿ã§ã™

programming

naoya

neta

ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°

ãƒ—ãƒã‚°ãƒ©ãƒž

è¨€è‘‰

amachang

program
ãƒªãƒ³ã‚¯
Burrows Wheeler Transform ã¨ Suffix Array - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
,. -â€'''''""Â¨Â¨Â¨ãƒ½ (.ï¼¿ï¼¿_,,,... -ï½§ã‚¡ï¾Œ|ã€€ã€€ã€€ã€€ã€€ã€€ã€€ã€€ã€€ã€€ã‚â€¦ã‚ã‚Šã®ã¾ã¾ ä»Šæ—¥ã€€èµ·ã“ã£ãŸäº‹ã‚’è©±ã™ãœï¼ |i i|ã€€ ã€€ }!ã€€}} /ï¼| |lï½¤{ã€€ ã€€j}ã€€/,,ï½¨//ï½œã€€ã€€ã€€ã€€ã€€ã€€ã€€ã€ŽBWT ã«ã¤ã„ã¦èª¿ã¹ã¦ã„ãŸã‚‰ Suffix Array ã®ãƒ©ã‚¤ãƒ–ãƒ©ãƒªãŒã§ãã¦ã„ãŸã€ i|:!ãƒ¾ï½¤_ï¾‰ï¼ u {:}//ï¾ |ï¾˜ u' }ã€€ ,ï¾‰ã€€_,!V,ï¾Š | ï¼Â´fãƒˆï½¤_{ï¾™{,ã‚£'ï½…ï¾—ã€€, ï¾€äººã€€ã€€ã€€ã€€ã€€ã€€ã€€ã€€ãªâ€¦ã€€ä½•ã‚’è¨€ã£ã¦ã‚‹ã®ã‹ã€€ã‚ã‹ã‚‰ããƒ¼ã¨æ€ã†ãŒ /' ã€€ ãƒ¾|å®€| {Â´,)âŒ’`/ |<ãƒ½ï¾„iã‚ã€€ã€€ã€€ã€€ã€€ã€€ã€€ã€€ãŠã‚Œã‚‚ä½•ã‚’ã•ã‚ŒãŸã®ã‹ã‚ã‹ã‚‰ãªã‹ã£ãŸâ€¦ ,ï¾žã€€ ï¼ )ãƒ½ iLï¾š ã€€u' |ã€€| ãƒ¾ï½Œï¾„ï¾Šã€‰ |ï¼_ï¼ã€€ ï¾Š !ãƒ‹âŠ‡ã€€'ï¼:} ã€€V:::::ãƒ½ã€€ã€€ã€€ã€€ã€€ã€€ã€€ã€€é ãŒã©ã†ã«ã‹ãªã‚Šãã†ã ã£ãŸâ€¦ /ï¼ äºŒäºŒäºŒ7'T'' ï¼u'ã€€__ /:::::::/ï½€ãƒ½ /'
mechairoi 2009/12/13
algorithm

suffixarray

bwt

naoya

perl

todo

nlp

programming

suffix array

devel
ãƒªãƒ³ã‚¯
CodeZine ã«ã¦ KOF 2008 ã®è¨˜äº‹ã¨è£œè¶³ - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
å¤§é˜ªå—æ¸¯ATCã§é–‹å‚¬ã•ã‚ŒãŸã€Œé–¢è¥¿ã‚ªãƒ¼ãƒ—ãƒ³ã‚½ãƒ¼ã‚¹2008ã€ã®2æ—¥ç›®ï¼ˆ11æœˆ8æ—¥ï¼‰åˆå‰ä¸ã®ã‚»ãƒƒã‚·ãƒ§ãƒ³ã§ã€æ ªå¼ä¼šç¤¾ã¯ã¦ãªCTOã®ä¼Šè—¤ç›´ä¹Ÿæ°ãŒã€Œã¯ã¦ãªæµå¤§è¦æ¨¡ãƒ‡ãƒ¼ã‚¿å‡¦ç†ã€ã¨é¡Œã—ãŸç™ºè¡¨ã‚’è¡Œã£ãŸã€‚ CodeZine ã§å…ˆæ—¥ã® KOF 2008 (ã‚ã‚‰ã‹ã˜ã‚è¨€ã£ã¦ãŠãã¾ã™ãŒ King of Fighters ã§ã¯ãªã„ã§ã™ã‚ˆã€é–¢è¥¿ã‚ªãƒ¼ãƒ—ãƒ³ãƒ•ã‚©ãƒ¼ãƒ©ãƒ ã§ã™) ã®ç™ºè¡¨ã‚’è¨˜äº‹ã«ã—ã¦ã„ãŸã ãã¾ã—ãŸã€‚ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã™ã€‚ ç™ºè¡¨è³‡æ–™ã¯ä»¥ä¸‹ã®ã‚¨ãƒ³ãƒˆãƒªãƒ¼ã«ã‚ã‚Šã¾ã™ã®ã§ä¸€ç·’ã«ã”è¦§ã„ãŸã ã‘ã‚Œã°ã¨æ€ã„ã¾ã™ã€‚ http://d.hatena.ne.jp/naoya/20081111/1226395400 ã•ã¦ã€è¨˜äº‹å†…å®¹ã«ã¤ã„ã¦å°‘ã—è£œè¶³ã‚’ã—ã¦ãŠããŸã„ã¨æ€ã„ã¾ã™ã€‚ ãƒ¡ãƒ¢ãƒªã¨ãƒ‡ã‚£ã‚¹ã‚¯ã®é€Ÿåº¦æ¯”è¼ƒã«ã¤ã„ã¦ ã€Œãƒ¡ãƒ¢ãƒªã¯ãƒ‡ã‚£ã‚¹ã‚¯ã® 150 å€ã€ã¨ã„ã†è©±ã§ã™ãŒã€ãã®å¾ŒçŸ¥äººã¨è©±ã—ã¦æ¤œç´¢ã®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã‚’ã‚·ãƒ¼ã‚¯ã™ã‚‹å ´åˆãªã©ã¯ ms å¯¾ ns ãã‚‰ã„é•
mechairoi 2009/12/13
server

kof2008

naoya

DB

hatena

scalability

db

ã¯ã¦ãª

è² è·åˆ†æ•£

computing
ãƒªãƒ³ã‚¯
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚¤ãƒ³ãƒˆãƒãƒ€ã‚¯ã‚·ãƒ§ãƒ³ç¬¬24ç« å˜ä¸€å§‹ç‚¹æœ€çŸè·¯å•é¡Œ - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚¤ãƒ³ãƒˆãƒãƒ€ã‚¯ã‚·ãƒ§ãƒ³ã®è¼ªè¬›ã§ã€ç¬¬24ç« ã®å˜ä¸€å§‹ç‚¹æœ€çŸè·¯å•é¡Œã‚’æ‹…å½“ã—ã¾ã—ãŸã€‚ç™ºè¡¨ã«ä½¿ã£ãŸè³‡æ–™ã‚’ä»¥ä¸‹ã«ã‚¢ãƒƒãƒ—ãƒãƒ¼ãƒ‰ã—ã¾ã—ãŸã€‚ http://bloghackers.net/~naoya/ppt/090622_shortest_paths.ppt SlideShare ã¯ã“ã¡ã‚‰ã€‚ãƒ•ã‚©ãƒ³ãƒˆã®é–¢ä¿‚ã§ã‚°ãƒ©ãƒ•ãŒå´©ã‚ŒãŸã‚Šã—ã¦ã„ã‚‹ã®ã§ã€ppt ã§å‚ç…§ã—ãŸæ–¹ãŒè¦‹ã‚„ã™ã„ã‹ã¨æ€ã„ã¾ã™ã€‚ Introduction to Algorithms#24 Shortest-Paths Probl emView more OpenOffice presentations from Naoya Ito. å˜ä¸€å§‹ç‚¹æœ€çŸè·¯å•é¡Œã¯ã€é‡ã¿ä»˜ãæœ‰å‘ã‚°ãƒ©ãƒ•ã®æœ€çŸè·¯æœ¨ã‚’æ±‚ã‚ã‚‹å•é¡Œã§ã™ã€‚å„é ‚ç‚¹ã«æœ€çŸè·¯é‡ã¿ã‚’è¨˜éŒ²ã™ã‚‹ã®ã§ã™ãŒã€ã¯ã˜ã‚ã«å„é ‚ç‚¹ã®é‡ã¿ã‚’âˆžã¨ã—ã¦ã€ã€Œç·©å’Œã€ã¨å‘¼ã°ã‚Œã‚‹æ“ä½œã«ã‚ˆã‚Šå¾ã€…ã«é ‚ç‚¹ã®é‡ã¿ã‚’æœ€çŸè·¯é‡ã¿ã«è¿‘ã¥ã‘ã¦ã„ãã€ã¨ã„ã†ã®
mechairoi 2009/12/13
Unlabeled

algorithm

è³‡æ–™

naoya

hatena

graph

programming

Algorithm

*ã‚ã¨ã§èªã‚€

å®Ÿè£…
ãƒªãƒ³ã‚¯
Perl ã§ Range Coder (å†æŒ‘æˆ¦) - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
ä»¥å‰ã«ã‚‚ Perl ã§ Range Coder ã‚’å®Ÿè£…ã—ãŸ (http://d.hatena.ne.jp/naoya/20080927/1222512024) ã®ã§ã™ãŒã€å½“æ™‚ã¯ç†è§£ã‚‚æ›–æ˜§ãªã¾ã¾é€Ÿåº¦ã«ã‚‚æ°—ã‚’é£ã‚ãšã«å®Ÿè£…ã—ã¦ã„ã¾ã—ãŸã€‚ å†åº¦æ”¹ã‚ã¦ã€Range Coder ã‚’å®Ÿè£…ã—ã¦ã¿ã¾ã—ãŸã€‚ http://github.com/naoya/perl-RangeCoder/tree/master README ã«è¨˜è¼‰ã—ãŸé€šã‚Šã€é™çš„ Range Coder*1ã€Binary Indexed Tree ã‚’ç”¨ã„ãŸé©å¿œåž‹ Range Coderã€ãã‚Œã‹ã‚‰ã¤ã„ã§ã« 1-order ã®æœ‰é™æ–‡è„ˆãƒ¢ãƒ‡ãƒ«ã‚’ã‚‚ã¡ã„ãŸã‚‚ã®ã‚’ä½œã£ã¦ã¿ã¾ã—ãŸã€‚ã„ãšã‚Œã‚‚ Algorithms with Python ã®æƒ…å ± (1, 2, 3)ã‚’å‚è€ƒã«å®Ÿè£…ã—ã¦ã„ã¾ã™ã€‚ Canterbury Corpus ã® alice29.txt ã¯ 0-
mechairoi 2009/12/13
algorithm

perl

naoya

Perl

Algorithm

åœ§ç¸®
ãƒªãƒ³ã‚¯
1