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

tridentfield id:tridentfield

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

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

ç´°ã‹ã™ãŽã¦ä¼ã‚ã‚Šã«ãã„TopCoderã®ã‚³ãƒ¼ãƒ‡ã‚£ãƒ³ã‚°ã‚¹ã‚ãƒ«å‘ä¸Šãƒžã‚¸ãƒƒã‚¯
ç´°ã‹ã™ãŽã¦ä¼ã‚ã‚Šã«ãã„TopCoderã®ã‚³ãƒ¼ãƒ‡ã‚£ãƒ³ã‚°ã‚¹ã‚ãƒ«å‘ä¸Šãƒžã‚¸ãƒƒã‚¯ï¼šæœ€å¼·æœ€é€Ÿã‚¢ãƒ«ã‚´ãƒªã‚ºãƒžãƒ¼é¤Šæˆè¬›åº§ï¼ˆ1/3 ãƒšãƒ¼ã‚¸ï¼‰ ç«¶æŠ€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¯ãƒ¬ãƒ™ãƒ«ã®é«˜ã„äººãŸã¡ã®é›†ã¾ã‚Šâ€•â€•ãã‚“ãªè€ƒãˆã‚’æŒã£ã¦ã„ã‚‹åˆå¿ƒè€…ã®æ–¹ã€TopCoderã¯ã‚ãªãŸã®ã‚³ãƒ¼ãƒ‡ã‚£ãƒ³ã‚°ã‚¹ã‚ãƒ«ã‚’çˆ†ç™ºçš„ã«é«˜ã‚ã‚‹é”æ³•ã®ã‚ˆã†ãªå ´ã§ã™ã€‚ä»Šå›žã¯ã€åˆå¿ƒè€…ã«ã“ããŠå‹§ã‚ã—ãŸã„TopCoderã®é…åŠ›ã«ã¤ã„ã¦è€ƒãˆã¾ã™ã€‚ æ•™è‚²çš„ãªè¦³ç‚¹ã‹ã‚‰è¦‹ã‚‹TopCoder ä»Šå›žã‹ã‚‰TopCoderã«é–¢ã™ã‚‹å®Ÿè·µçš„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’è§£èª¬ã—ã¦ã„ãäºˆå®šã§ã—ãŸãŒã€åºç›¤ã®ã†ã¡ã«è§¦ã‚Œã¦ãŠããŸã„ã“ã¨ãŒã‚ã‚Šã¾ã—ãŸã®ã§ã€ä»Šå›žã®æž•ã¯â€œæ•™è‚²çš„è¦–ç‚¹ã‹ã‚‰è¦‹ã‚‹TopCoderâ€ã¨ã„ã†ãƒ†ãƒ¼ãƒžã§å°‘ã—æ›¸ã“ã†ã‹ã¨æ€ã„ã¾ã™ã€‚ ã¾ãšã€æœ€åˆã«å®£è¨€ã—ã¦ãŠããŸã„ã“ã¨ã¯ã€ã“ã®é€£è¼‰ã¯åˆå¿ƒè€…å‘ãã§ã‚ã‚‹ã€ã¨ã„ã†ã“ã¨ã§ã™ã€‚ã€Œã©ã†è€ƒãˆã¦ã‚‚ä¸Šç´šè€…å‘ã‘ã ã‚ã†ã€ã¨ã„ã†æ„è¦‹ã¯ãŸãã•ã‚“ã®æ–¹ã‹ã‚‰å¯„ã›ã‚‰ã‚Œã¦ã„ã¾ã™ãŒã€ç†è€…ã¯ã€ã¾ã ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ãƒ¬
tridentfield 2014/02/28
programming

algorithm
ãƒªãƒ³ã‚¯
é«˜é€Ÿãªå®‰å®šã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ "TimSort" ã®è§£èª¬ - Preferred Networks Tech Blog
å…ˆæ—¥ã€TimSortã¨ã„ã†ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒè©±é¡Œã«ãªã‚Šã¾ã—ãŸã€‚TimSortã¯ã€é«˜é€Ÿãªå®‰å®šã‚½ãƒ¼ãƒˆã§ã€Python(>=2.3)ã‚„Java SE 7ã€ãŠã‚ˆã³Androidã§ã®æ¨™æº–ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã—ã¦æŽ¡ç”¨ã•ã‚Œã¦ã„ã‚‹ãã†ã§ã™ã€‚ C++ã®std::sort()ã‚ˆã‚Šã‚‚é«˜é€Ÿã§ã‚ã‚‹ã¨ã„ã†ãƒ™ãƒ³ãƒãƒžãƒ¼ã‚¯çµæžœ1ãŒè©±é¡Œã«ãªã‚Š(å¾Œã«ãƒ™ãƒ³ãƒãƒžãƒ¼ã‚¯ã®èª¤ã‚Šã¨åˆ¤æ˜Ž)ã€ç§ã‚‚ãã‚Œã§å˜åœ¨ã‚’çŸ¥ã‚Šã¾ã—ãŸã€‚å®Ÿéš›ã®ã¨ã“ã‚ã€ãƒ©ãƒ³ãƒ€ãƒ ãªãƒ‡ãƒ¼ã‚¿ã«å¯¾ã—ã¦ã¯ã‚¯ã‚¤ãƒƒã‚¯ã‚½ãƒ¼ãƒˆ(IntroSort)ã»ã©é€Ÿããªã„ã‚ˆã†ã§ã™ãŒã€ã‚½ãƒ¼ãƒˆã¨ã„ã†ã‚·ãƒ³ãƒ—ãƒ«ãªã‚¿ã‚¹ã‚¯ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒä»Šã‚‚ãªãŠæ”¹è‰¯ã•ã‚Œç¶šã‘ã¦ã„ã¦ã€ãªãŠã‹ã¤äººã€…ã®é–¢å¿ƒã‚’å¼•ãã¨ã„ã†ã®ã¯èˆˆå‘³æ·±ã„ã‚‚ã®ã§ã™ã€‚ ã—ã‹ã—ãªãŒã‚‰ã€ã‚ªãƒªã‚¸ãƒŠãƒ«ã®TimSortã®ã‚³ãƒ¼ãƒ‰ã¯è‹¥å¹²è¤‡é›‘ã§ã€å®Ÿéš›ã®ã¨ã“ã‚ã©ã†ã„ã†ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãªã®ã‹ã‚ã‹ã‚Šã¥ã‚‰ã„ã¨ã“ã‚ãŒã‚ã‚‹ã¨æ€ã„ã¾ã™ã€‚ãã“ã§ä»Šå›žã¯TimSortã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ã§ãã‚‹ã ã‘ã‚ã‹ã‚Šã‚„ã™ãè§£
tridentfield 2011/10/26
Algorithm

Programming
ãƒªãƒ³ã‚¯
ãƒ—ãƒªãƒ æ³•ï¼ˆæœ€å°å…¨åŸŸæœ¨å•é¡Œï¼‰
ãƒ—ãƒªãƒ æ³• (Prim's MST Algorithm) ã¯æœ€å°å…¨åŸŸæœ¨å•é¡Œã‚’åŠ¹çŽ‡çš„ã«è§£ãã‚°ãƒ©ãƒ•ç†è«–ã«ãŠã‘ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã™ã€‚ æœ€å°å…¨åŸŸæœ¨ (MST: Minimum Spanning Tree) ã¨ã¯ï¼Œã‚°ãƒ©ãƒ•ã‚’æ§‹æˆã™ã‚‹ã€Œè¾ºã®é‡ã¿ã®ç·å’Œã€ãŒæœ€å°ã¨ãªã‚‹å…¨åŸŸæœ¨ã§ã™ã€‚ ã€Œå…¨åŸŸã€ã¨ã¯ï¼Œå…ƒã®ã‚°ãƒ©ãƒ•ãŒã‚ã£ã¦ï¼Œãã®éƒ¨åˆ†ã‚°ãƒ©ãƒ•ã®ã†ã¡ï¼ˆè¾ºã®æ§‹æˆã¯å¤‰ã‚ã£ã¦ã„ã¦ã‚‚ï¼‰é ‚ç‚¹é›†åˆãŒåŒã˜ã‚°ãƒ©ãƒ•ã‚’æŒ‡ã—ã¾ã™ã€‚ æœ¨ã¨ã¯é€£çµ (connected) ã§ã‹ã¤é–‰è·¯ (loop) ãŒç„¡ã„ã‚°ãƒ©ãƒ•ãªã®ã§ï¼Œã¤ã¾ã‚Šï¼Œå…ƒã¨ãªã‚‹ï¼ˆæœ¨ã§ã¯ãªã„ï¼‰ã‚°ãƒ©ãƒ•ãŒã‚ã£ã¦ï¼Œ ãã“ã‹ã‚‰ï¼Œåˆ‡ã‚Šé›¢ã•ã‚ŒãŸé ‚ç‚¹ã‚’ä½œã‚‰ãšã«ï¼ˆé€£çµã§ã‚ã‚Šï¼‰ï¼Œé–‰è·¯ã‚’ä½œã‚‹ã‚ˆã†ãªè¾ºãŒã€Œè¾ºã®é‡ã¿ã®ç·å’ŒãŒæœ€å°ã¨ãªã‚‹ã‚ˆã†ã«ã€å…¨ã¦å–ã‚Šé™¤ã‹ã‚ŒãŸï¼ˆæœ¨ã§ã‚ã‚‹ï¼‰ã‚°ãƒ©ãƒ•ã‚’æ±‚ã‚ã‚‹å•é¡Œã§ã™ã€‚ MSTï¼ˆæœ€å°å…¨åŸŸæœ¨ï¼‰ã‚’æ±‚ã‚ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã—ã¦ã¯ï¼Œã“ã“ã§èª¬æ˜Žã™ã‚‹ãƒ—ãƒªãƒ æ³•ã®ä»–ã«ã‚¯ãƒ©ã‚¹ã‚«ãƒ«æ³•ãŒæœ‰åã§ã™ã€‚ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ä»¥ä¸‹ã®ã‚°ãƒ©ãƒ•ã‚’
tridentfield 2010/09/16
algorithm

ã‚°ãƒ©ãƒ•ç†è«–
ãƒªãƒ³ã‚¯
ã€Œæœ€å¼·æœ€é€Ÿã‚¢ãƒ«ã‚´ãƒªã‚ºãƒžãƒ¼é¤Šæˆè¬›åº§ã€é–¢é€£ã®æœ€æ–° ãƒ‹ãƒ¥ãƒ¼ã‚¹ãƒ»ãƒ¬ãƒ“ãƒ¥ãƒ¼ãƒ»è§£èª¬ è¨˜äº‹ ã¾ã¨ã‚ - ITmedia Keywords
æœ€å¼·æœ€é€Ÿã‚¢ãƒ«ã‚´ãƒªã‚ºãƒžãƒ¼é¤Šæˆè¬›åº§ï¼š ãã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€è²ªæ¬²ã«ã¤ãâ€•â€•è²ªæ¬²æ³•ã®ã‚¹ã‚¹ãƒ¡ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®ä¸–ç•Œã«ãŠã„ã¦ã€æ¬²å¼µã‚Šã§ã‚ã‚‹ã“ã¨ã¯ã¨ãã«æœ‰åˆ©ã«åƒãã“ã¨ãŒã‚ã‚Šã¾ã™ã€‚ä»Šå›žã¯ã€è²ªæ¬²æ³•ã¨å‘¼ã°ã‚Œã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ç´¹ä»‹ã—ãªãŒã‚‰ã€ãƒãƒ¼ãƒ‰ãªå•é¡Œã«æŒ‘æˆ¦ã—ã¦ã¿ã¾ã—ã‚‡ã†ã€‚ã“ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒä½¿ãˆã‚‹ã‹ã©ã†ã‹ã®è¦‹æ¥µã‚ãŒã§ãã‚‹ã‚ˆã†ã«ãªã‚Œã°ã€ã‚ãªãŸã®è«–ç†çš„æ€è€ƒåŠ›ã¯ã‹ãªã‚Šã®ãƒ¬ãƒ™ãƒ«ãªã®ã§ã™ã€‚ï¼ˆ2010/9/4ï¼‰ æœ€å¼·æœ€é€Ÿã‚¢ãƒ«ã‚´ãƒªã‚ºãƒžãƒ¼é¤Šæˆè¬›åº§ï¼š ç—…ã¿ã¤ãã«ãªã‚‹ã€Œå‹•çš„è¨ˆç”»æ³•ã€ã€ãã®æ·±æ·µã«è¿«ã‚‹ æ•°å›žã«ã‚ãŸã£ã¦å‹•çš„è¨ˆç”»æ³•ãƒ»ãƒ¡ãƒ¢åŒ–å†å¸°ã«ã¤ã„ã¦è§£èª¬ã—ã¦ãã¾ã—ãŸãŒã€ä»Šå›žã¯å®Ÿè·µç·¨ã¨ã—ã¦ã€ãƒŠãƒƒãƒ—ã‚µãƒƒã‚¯å•é¡Œã¸ã®æŒ‘æˆ¦ã‚’è¶³ãŒã‹ã‚Šã«ã€ãã®é•·æ‰€ã¨çŸæ‰€ã®ç´¹ä»‹ã€ç†è§£åº¦ãƒã‚§ãƒƒã‚¯ã‚·ãƒ¼ãƒˆãªã©ã‚’ç”¨æ„ã—ã¾ã—ãŸã€‚ç‰¹ã«ã€å‹•çš„è¨ˆç”»æ³•ã«ã¤ã„ã¦æ·±ãæŽ˜ã‚Šä¸‹ã’ã€çš†ã•ã‚“ã‚’å‹•çš„è¨ˆç”»æ³•ãƒžã‚¹ã‚¿ãƒ¼ã®é“ã«ã”æ¡ˆå†…ã—ã¾ã™ã€‚ï¼ˆ2010/5/15ï¼‰ æœ€å¼·æœ€é€Ÿã‚¢ãƒ«ã‚´ãƒªã‚ºãƒžãƒ¼é¤Šæˆè¬›åº§ï¼š ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒžãƒ¼ã®ç™»
tridentfield 2010/01/17
programming

algorithm

ITmedia
ãƒªãƒ³ã‚¯
ä¸€ç•ªå³ç«¯ã®ç«‹ã£ã¦ã„ã‚‹ãƒ“ãƒƒãƒˆä½ç½®ã‚’æ±‚ã‚ã‚‹ã€Œã‚‚ã®ã™ã”ã„ã€ã‚³ãƒ¼ãƒ‰ - å½“é¢C#ã¨.NETãªè¨˜éŒ²
ä¸€ç•ªå³ç«¯ã®ç«‹ã£ã¦ã„ã‚‹ãƒ“ãƒƒãƒˆä½ç½®(RightMostBit)ã‚’æ±‚ã‚ã‚‹ã‚³ãƒ¼ãƒ‰ã§é€Ÿã„ã®ãªã„ã‹ãªãƒ¼ã¨æŽ¢ã—ã¦ã„ãŸã‚‰ã€ã‚‚ã®ã£ã£ã£ã™ã”ã„ã‚³ãƒ¼ãƒ‰ã«å‡ºä¼šã£ã¦ã—ã¾ã£ãŸã®ã§ã”ç´¹ä»‹ã€‚2ch ã®ãƒ“ãƒƒãƒˆæ¼”ç®—ã‚¹ãƒ¬ã§ 32bit å€¤ã®ã‚³ãƒ¼ãƒ‰ã«å‡ºä¼šã£ã¦è¡æ’ƒã‚’å—ã‘ã¦ã€ãã®å¾Œ 64bit å€¤ç‰ˆã®ãƒ’ãƒ³ãƒˆã‚’è¦‹ã¤ã‘ãŸã®ã§ã‚³ãƒ¼ãƒ‰ã‚’æ›¸ã„ã¦ã¿ã¾ã—ãŸã€‚ ã“ã®å•é¡Œã¯ ãƒãƒƒã‚«ãƒ¼ã®ãŸã®ã—ã¿â€•æœ¬ç‰©ã®ãƒ—ãƒã‚°ãƒ©ãƒžã¯ã„ã‹ã«ã—ã¦å•é¡Œã‚’è§£ãã‹ (Google book search ã§åŽŸè‘— Hacker's delight ãŒèªã‚ãŸã®ã§ãã‚Œã§æ¸ˆã¾ã›ãŸ) ã§ number of trailing zeros (ntz) ã¨ã—ã¦ç´¹ä»‹ã•ã‚Œã¦ã„ã¾ã™ã€‚bit ã§è€ƒãˆãŸã¨ãã«å³å´ã« 0 ãŒã„ãã¤ã‚ã‚‹ã‹ã‚’æ•°ãˆã‚‹ã‚‚ã®ã€‚1 ã ã¨ 0ã€2 ã ã¨ 1ã€0x80 ãªã‚‰ 7ã€12 ãªã‚‰ 2 ã¨ã„ã£ãŸãã‚ã„ã€‚0 ã®ã¨ãã«è¡¨é¡Œã©ãŠã‚Šã®å•é¡Œã¨ã—ã¦è€ƒãˆã‚‹ã¨ã„ãã¤ã‚’è¿”ã™ã®ï¼Ÿã£ã¦ã“ã¨ã«ãªã‚‹ã®ã§ã€
tridentfield 2009/07/09
algorithm

programming
ãƒªãƒ³ã‚¯
æ–°ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ã§ã‚‚ä½¿ã‚ã‚Œã¦ã‚‹Complement Naive Bayesã‚’è§£èª¬ã™ã‚‹ã‚ˆ - å°„æ’ƒã—ã¤ã¤å‰è»¢ æ”¹
æ–°ã¯ã¦ãƒ–æ£å¼ãƒªãƒªãƒ¼ã‚¹è¨˜å¿µã¨ã„ã†ã“ã¨ã§ã€‚ã‚‚ã†ãƒªãƒªãƒ¼ã‚¹ã‹ã‚‰ä½•é€±é–“ã‚‚çµŒã£ã¡ã‚ƒã£ãŸã‘ã©ã€‚ æ–°ã¯ã¦ãªãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ã§ã¯ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ã‚¨ãƒ³ãƒˆãƒªã‚’ã‚«ãƒ†ã‚´ãƒªã¸ã¨è‡ªå‹•ã§åˆ†é¡žã—ã¦ã„ã‚‹ãŒã€ã“ã®ã‚«ãƒ†ã‚´ãƒªåˆ†é¡žã«ä½¿ã‚ã‚Œã¦ã„ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯Complement Naive Bayesã‚‰ã—ã„ã€‚ä»Šæ—¥ã¯ã“ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦ç´¹ä»‹ã—ã¦ã¿ã‚‹ã€‚ Complement Naive Bayesã¯2003å¹´ã®ICMLã§J. Rennieã‚‰ãŒææ¡ˆã—ãŸæ‰‹æ³•ã§ã‚ã‚‹ã€‚ICMLã¨ã„ã†ã®ã¯ã€æ©Ÿæ¢°å¦ç¿’ã«é–¢ã™ã‚‹ï¼ˆãŸã¶ã‚“ï¼‰æœ€é›£é–¢ã®å¦ä¼šã§ã€æŽ¡æŠžçŽ‡ã¯ã“ã“æ•°å¹´ã¯30%ã‚’åˆ‡ã£ã¦ã„ã‚‹ã€‚2003ã¯119/371ã§ã€32.1%ã®æŽ¡æŠžçŽ‡ã ã£ãŸã‚ˆã†ã ã€‚ Complement Naive Bayesã®ä½ç½®ã¥ã‘ã¯ å®Ÿè£…ãŒç°¡å˜ å¦ç¿’æ™‚é–“ãŒçŸã„ æ€§èƒ½ã‚‚ãã“ãã“ã‚ˆã„ ã¨ã„ã†æ„Ÿã˜ã§ã€2003å¹´æ®µéšŽã«ã‚ã£ã¦ã‚‚ã€çµ¶å¯¾çš„ãªæ€§èƒ½ã§ã¯SVMã«è² ã‘ã¦ã„ãŸã€‚ã—ã‹ã—ã€å¦ç¿’ãŒæ—©ã„ã¨ã„ã†ã®ã¯å®Ÿã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·
tridentfield 2008/12/17
programming

algorithm

hatena
ãƒªãƒ³ã‚¯
Introduction to Information Retrieval
This is the companion website for the following book. Christopher D. Manning, Prabhakar Raghavan and Hinrich SchÃ¼tze, Introduction to Information Retrieval, Cambridge University Press. 2008. You can order this book at CUP, at your local bookstore or on the internet. The best search term to use is the ISBN: 0521865719. The book aims to provide a modern approach to information retrieval from a co
tridentfield 2008/08/28
algorithm

programming

search
ãƒªãƒ³ã‚¯
1