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

ohnishiakira id:ohnishiakira

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

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

ãƒãƒŸãƒ³ã‚°è·é›¢ - Wikipedia
4ãƒ“ãƒƒãƒˆæ–‡å—åˆ—ã®ãƒãƒŸãƒ³ã‚°è·é›¢ã‚’å›³ç¤ºã—ãŸã‚‚ã®ã€‚é ‚ç‚¹ã«ç‰¹å®šã®ãƒ“ãƒƒãƒˆã®çµ„åˆã›ãŒå¯¾å¿œã—ã¦ã„ã¦ã€é ‚ç‚¹é–“ã®è¾ºã®æ•°ãŒãƒãƒŸãƒ³ã‚°è·é›¢ã«å¯¾å¿œã™ã‚‹ æƒ…å ±ç†è«–ã«ãŠã„ã¦ã€ãƒãƒŸãƒ³ã‚°è·é›¢ï¼ˆãƒãƒŸãƒ³ã‚°ãã‚‡ã‚Šã€è‹±: Hamming distanceï¼‰ã¨ã¯ã€ç‰ã—ã„æ–‡å—æ•°ã‚’æŒã¤äºŒã¤ã®æ–‡å—åˆ—ã®ä¸ã§ã€å¯¾å¿œã™ã‚‹ä½ç½®ã«ã‚ã‚‹ç•°ãªã£ãŸæ–‡å—ã®å€‹æ•°ã§ã‚ã‚‹ã€‚åˆ¥ã®è¨€ã„æ–¹ã‚’ã™ã‚Œã°ã€ãƒãƒŸãƒ³ã‚°è·é›¢ã¯ã€ã‚ã‚‹æ–‡å—åˆ—ã‚’åˆ¥ã®æ–‡å—åˆ—ã«å¤‰å½¢ã™ã‚‹éš›ã«å¿…è¦ãªç½®æ›å›žæ•°ã‚’è¨ˆæ¸¬ã—ãŸã‚‚ã®ã§ã‚ã‚‹ã€‚ã“ã®ç”¨èªžã¯ã€ãƒªãƒãƒ£ãƒ¼ãƒ‰ãƒ»ãƒãƒŸãƒ³ã‚° (Richard Wesley Hamming) ã«ã¡ãªã‚“ã§å‘½åã•ã‚ŒãŸã‚‚ã®ã§ã€é¼»æŒ (humming) ã§ã¯ãªã„ã€‚ ãƒãƒŸãƒ³ã‚°è·é›¢ã¯ã€é è·é›¢é€šä¿¡ã«ãŠã‘ã‚‹å›ºå®šé•·ãƒã‚¤ãƒŠãƒªãƒ¼æ–‡å—åˆ—ã®ä¸ã§å¼¾ã‹ã‚ŒãŸãƒ“ãƒƒãƒˆæ•°ã‚„ã€ã‚¨ãƒ©ãƒ¼ã®æ¦‚ç®—ã‚’æ•°ãˆã‚‹ã®ã«ç”¨ã„ã‚‰ã‚Œã‚‹ãŸã‚ã«ã€ä¿¡å·è·é›¢ã¨ã‚‚å‘¼ã°ã‚Œã‚‹ã€‚æ–‡å—æ•° n ã®1ãƒ“ãƒƒãƒˆæ–‡å—åˆ—é–“ã®ãƒãƒŸãƒ³ã‚°è·é›¢ã¯ã€ãã‚Œã‚‰ã®æ–‡å—åˆ—é–“ã®æŽ’ä»–çš„è«–ç†å’Œã®ãƒãƒŸãƒ³ã‚°é‡ã¿ï¼ˆ
ohnishiakira 2012/03/20
algorithm

programming
ãƒªãƒ³ã‚¯
algorithm - Patricia Trie (Radix Trie) ã‚’ JavaScript ã§ : 404 Blog Not Found
2012å¹´01æœˆ21æ—¥21:45 ã‚«ãƒ†ã‚´ãƒªTipsLightweight Languages algorithm - Patricia Trie (Radix Trie) ã‚’ JavaScript ã§ ã‚¹ãƒžãƒ›æ‰‹è¢‹ 5æœ¬æŒ‡å…¨ã¦ã‚¿ãƒƒãƒã§ãã‚‹ smarttouch 5105 ãƒŸãƒ‰ãƒªå®‰å…¨ å¯’ã„ã®ã§ã“ã‚Œã‚’ã—ãŸã¾ã¾æ›¸ãã¾ã—ãŸã€‚ dankogai/js-trie-patricia - GitHub 404 Blog Not Found:Algorithm - é€£æƒ³é…åˆ—ã®å®Ÿè£…ã¨ã—ã¦ã®ãƒãƒƒã‚·ãƒ¥ã¯ã‚ªãƒ¯ã‚³ãƒ³? TrieãŒé€£æƒ³é…åˆ—ã®ä»£ã‚ã‚Šã«ãªã‚‹ã¨ã„ã†ã®ã‚’ä½“ã§ã‚‚ç´å¾—ã—ã¦ãŠããŸã‹ã£ãŸã®ã§ã€‚ ã¯ã˜ã‚ã¦ã®Trie ã¨ã„ã†ã‚ã‘ã§æ—©é€Ÿä½œã£ã¦ã¿ã¾ã—ã‚‡ã†ã€‚ã‚ã£ã‘ã«ã¨ã‚‰ã‚Œã‚‹ã»ã©ç°¡å˜ã§ã™ã€‚ã“ã“ã§ã¯Objectã€ã¤ã¾ã‚Šé€£æƒ³é…åˆ—ã§åˆ†å²ç‚¹ã‚’å®Ÿç¾ã™ã‚‹ã¨ã„ã†ã‚ã‚‹æ„å‘³æœ¬æœ«è»¢å€’ãªã“ã¨ã‚’ã—ã¦ã„ã¾ã™ãŒã€JSãªã‚‰ã°ã—ã‹ãŸãŒãªã„ã€‚ var Trie =
ohnishiakira 2012/01/22
algorithm
ãƒªãƒ³ã‚¯
ç´ æ•°åˆ—æŒ™ã«ã¤ã„ã¦ - MugiCha
Competitive Programming Advent Calendar 3æ—¥ç›®ã¯ã€æ•°å¦ã£ã½ã„è©±ã‚’ã—ãŸã„ã¨æ€ã„ã¾ã™ã€‚ Nä»¥ä¸‹ã®ç´ æ•°ã‚’ã™ã¹ã¦æ±‚ã‚ã‚ˆã€‚ Nä»¥ä¸‹ã®ç´ æ•°ã®å€‹æ•°ã‚’æ±‚ã‚ã‚ˆã€‚ Aä»¥ä¸ŠBä»¥ä¸‹ã®ç´ æ•°ã®å€‹æ•°ã‚’æ±‚ã‚ã‚ˆã€‚ ã“ã‚“ãªæ„Ÿã˜ã®å•é¡Œã‚’è¦‹ãŸã“ã¨ãŒã‚ã‚‹ã¨æ€ã„ã¾ã™ã€‚ã¾ãŸå•é¡Œã¨ã—ã¦ã§ãªãã¦ã‚‚ã€è§£ãéŽç¨‹ã«ã“ã®ã‚ˆã†ãªã‚µãƒ–å•é¡Œã‚’è§£ã‹ãªã‘ã‚Œã°ã„ã‘ãªã„å ´åˆã‚‚ã‚ˆãã‚ã‚‹ã¨æ€ã„ã¾ã™ã€‚ç´ æ•°ã«ã¤ã„ã¦ã¯èª¬æ˜Žã—ãªãã¦ã‚‚ã„ã„ã§ã™ã‚ˆãï¼Ÿ ã“ã®ã‚ˆã†ãªå•é¡Œã‚’ç´ æ•°åˆ—æŒ™ã¨å‘¼ã¶ã“ã¨ã«ã—ã¾ã™ã€‚ç´ æ•°åˆ—æŒ™ãŒã§ãã‚Œã°ã€å¤§ãã„æ•°ã®ç´ æ•°åˆ¤å®šã‚„ç´ å› æ•°åˆ†è§£ã‚’ã‚ã£ã¡ã‚ƒé«˜é€ŸåŒ–ã—ãŸã‚Šã€ãƒˆãƒ¼ãƒ†ã‚£ã‚¨ãƒ³ãƒˆé–¢æ•°ã€ãƒ¡ãƒ“ã‚¦ã‚¹é–¢æ•°ç‰ã€æ•°å¦ç³»ã®ã„ã‚ã‚“ãªé–¢æ•°ã‚’æ±‚ã‚ãŸã‚Šã§ãã¾ã™ã€‚æœ€è¿‘ã®ã‚‚ã®ã§ç´ æ•°åˆ—æŒ™ãŒã»ã¼å¿…é ˆã®ã‚‚ã®ã ã¨ Codeforces Beta Round #86 (Div. 1 Only) C. Double Happiness ICPC å›½å†…äºˆé¸ 2011 A
ohnishiakira 2011/12/04
æ•°å¦

ç´ æ•°

algorithm
ãƒªãƒ³ã‚¯
Algorithms by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani
ohnishiakira 2011/12/01
algorithm
ãƒªãƒ³ã‚¯
ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã®é¢æŽ¥ã§ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’çµ„ã¾ã›ã‚‹ç†ç”± | quipped
@shibataismã•ã‚“ãŒã€æ—¥çµŒBizã‚¢ã‚«ãƒ‡ãƒŸãƒ¼ã«ã€Œæ—¥æœ¬ã®ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã¯ã‚·ãƒªã‚³ãƒ³ãƒãƒ¬ãƒ¼ã§é€šç”¨ã™ã‚‹ã®ã‹ï¼Ÿã€ã¨ã„ã†è¨˜äº‹ã‚’æ›¸ã„ã¦ã„ã‚‹ã€‚ ã€Œåƒ•ã¯æ–‡ç³»ã ã‘ã©ã€ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã¨ã—ã¦ä¸€æµã ã€ã¨è‡ªå·±ä¸»å¼µã™ã‚‹äººãŒã„ã¾ã™ãŒã€æŽ¡ç”¨å´ã‹ã‚‰è¦‹ã¦å®Ÿéš›ã«ãã†ã§ã‚ã‚‹ã“ã¨ã¯ç¨€ã§ã™ã€‚ã‚·ãƒªã‚³ãƒ³ãƒãƒ¬ãƒ¼ã®ä¼æ¥ã§ã¯ã€æŽ¡ç”¨é¢æŽ¥ã®éš›ã«ã€Œ â—‹â—‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’æ›¸ã„ã¦ã¿ã¦ãã ã•ã„ã€ã¨ã„ã£ãŸã‚ˆã†ã«ã€å…·ä½“çš„ã‹ã¤å®Ÿè·µçš„ãªèª²é¡ŒãŒå‡ºã•ã‚Œã¾ã™ã€‚ã“ã†ã—ãŸé¢æŽ¥ã§ã€æ–‡ç³»ã®äººã¯ï¼ˆãã‚‚ãã‚‚å¤§å¦ã§ãã¡ã‚“ã¨å‹‰å¼·ã—ãŸã“ã¨ãŒãªã„ã®ã§ï¼‰é©åˆ‡ãªå›žç”ã‚’ã™ã‚‹ã®ãŒé›£ã—ã„å ´åˆãŒå¤šã„ã®ã§ã™ã€‚ ã¨ã‚ã‚‹ã®ã ãŒã€ã‚¢ãƒ¡ãƒªã‚«ã®å¤§å¦ã§æ•°å¦ã‚’å‹‰å¼·ã—ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¯ç‹¬ç¿’ã—ãŸã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã¨ã—ã¦1ã€å°‘ã—è£œè¶³ã—ã¦ã¿ãŸã„ã¨æ€ã†ã€‚ ã€Œæ–‡ç³»ã€ã ã‹ã‚‰ã¨ã„ã£ã¦è«¦ã‚ã‚‹å¿…è¦ã¯ãªã„ ã“ã‚Œã¯ã¾ã‚ãã®äººã®çµŒé¨“ã«ã‚ˆã‚‹ã®ã ã‚ã†ã‘ã©ã€æ–‡ç³»å‡ºèº«ã®ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã ã‹ã‚‰ã¨ã„ã£ã¦è«¦ã‚ã‚‹å¿…è¦ã¯ãªã„ã€‚[å¹³æž—ã•ã‚“](https://falla
ohnishiakira 2011/12/01
algorithm
ãƒªãƒ³ã‚¯
ã‚¨ã‚¤ãƒˆãƒ»ã‚¯ã‚¤ãƒ¼ãƒ³ - Wikipedia
ä¸€è¾ºã®ãƒžã‚¹ã‚’nã¨ã—ãŸå¤‰å½¢ç‰ˆã‚’ã€Œn-ã‚¯ã‚¤ãƒ¼ãƒ³ã€ãƒ‘ã‚ºãƒ«ã¨ã„ã†ã€‚ä¾‹ãˆã°ã€Œ4-ã‚¯ã‚¤ãƒ¼ãƒ³ã€ã§ã¯4Ã—4ã®ãƒžã‚¹ã§4å€‹ã®é§’ã‚’ä½¿ç”¨ã™ã‚‹ï¼ˆä»–ã«ã‚‚ç¸¦æ¨ªæ¯”ãŒ1:1ã§ã¯ãªã„çŸ©å½¢ã‚„ã€ãƒšã‚°ãƒ»ã‚½ãƒªãƒ†ã‚£ã‚¢ã®ç›¤é¢ã€ä¸å®šå½¢ãªã©ã„ã‚ã„ã‚è€ƒãˆã‚‰ã‚Œã‚‹ãŒã“ã“ã§ã¯è¨€åŠã—ãªã„ï¼‰ã€‚ 2-ã‚¯ã‚¤ãƒ¼ãƒ³ã¨3-ã‚¯ã‚¤ãƒ¼ãƒ³ã«ã¯è§£ãŒãªã„ã€‚ 4-ã‚¯ã‚¤ãƒ¼ãƒ³ä»¥ä¸Šãªã‚‰ä¸€è¾ºã®ãƒžã‚¹æ•°ã«ç‰ã—ã„æ•°ã®ã‚¯ã‚¤ãƒ¼ãƒ³ãŒç½®ã‘ã‚‹ã€‚ å˜ç´”ã«è¦‹ã¦nãŒå¢—ãˆã‚‹ã®ã«å¾“ã£ã¦ã€å…¨ãƒžã‚¹æ•°n2å€‹ã«å¯¾ã—ç½®ãé§’ã®æ•°ã¯nå€‹ã§ã‚ã‚‹ã‹ã‚‰ã€ç½®ã‘ã‚‹å ´æ‰€ï¼ˆã®å€™è£œï¼‰ã®å¢—ãˆæ–¹ã«ã‚ˆã‚Šã€è§£ã®æ•°ã«ã¯çµ„åˆã›çˆ†ç™ºãŒèµ·ãã‚‹ï¼ˆãŸã ã—nãŒ5ã‹ã‚‰6ã«å¢—ãˆã‚‹å ´åˆã¯è§£ã®æ•°ãŒæ¸›å°‘ã™ã‚‹ï¼‰ã€‚2009å¹´ã«ãƒ‰ãƒ¬ã‚¹ãƒ‡ãƒ³å·¥ç§‘å¤§å¦ã§26-ã‚¯ã‚¤ãƒ¼ãƒ³ãŒè¨ˆç®—ã•ã‚ŒãŸ[1]ã€‚ç¾åœ¨ã™ã¹ã¦ã®è§£ãŒåˆ¤æ˜Žã—ã¦ã„ã‚‹æœ€å¤§ã®ã‚‚ã®ã¯ã€2016å¹´ã«Q27 Projectã«ã‚ˆã£ã¦è¨ˆç®—ã•ã‚ŒãŸ27-ã‚¯ã‚¤ãƒ¼ãƒ³ã§ã‚ã‚‹[2]ã€‚ n=27ã¾ã§ã®è§£ã¯æ¬¡ã®é€šã‚Š[3]ã€‚ n åŸºæœ¬è§£ ãƒãƒªã‚¨ãƒ¼ã‚·ãƒ§ãƒ³è§£
ohnishiakira 2011/10/22
algorithm
ãƒªãƒ³ã‚¯
http://www.ic-net.or.jp/home/takaken/nt/queen/index.html
ohnishiakira 2011/10/22
algorithm
ãƒªãƒ³ã‚¯
Timsort - Wikipedia
Timsort is a hybrid, stable sorting algorithm, derived from merge sort and insertion sort, designed to perform well on many kinds of real-world data. It was implemented by Tim Peters in 2002 for use in the Python programming language. The algorithm finds subsequences of the data that are already ordered (runs) and uses them to sort the rem ainder more efficiently. This is done by merging runs until
ohnishiakira 2011/10/19
algorithm

Timsort
ãƒªãƒ³ã‚¯
å‡„ã„ãƒã‚«ãªãƒ—ãƒã‚°ãƒ©ãƒ - ã¨ã£ãã‚Šã°ãƒ¼
æœ€è¿‘ç®—æ•°ã°ã£ã‹ã‚Šã§ã™ãã“ã®ãƒ–ãƒã‚°ã€‚ã ã£ã¦é¢ç™½ã„ã‚“ã ã‚‚ã®ã€‚ ãã—ã ã®ã¯ã¦ãªã€Œå‡„ã„ãƒã‚«ãªãƒ—ãƒã‚°ãƒ©ãƒ ã‚’ä½œã‚ã†ã€ ã“ãªã„ã ã•ãã‚‰ã„ã•ã‚“ã¨ã€Œãƒãƒ–ãƒ«ã‚½ãƒ¼ãƒˆã£ã¦ãŸã¶ã‚“å†å¸°ã§ã§ãã‚‹ã‚ˆãã€ã¨ã‹ã£ã¦è©±ã—ã¦ãŸã®ã§ã™ãŒã€åƒ•ã¯ä»Šå›žã€å¾“æ¥ã®ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’è¶Šãˆã‚‹ç”»æœŸçš„ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’è€ƒæ¡ˆã—ã¾ã—ãŸã€‚ åä»˜ã‘ã¦ã€Œã‚·ãƒ§ãƒƒãƒˆã‚¬ãƒ³ã‚½ãƒ¼ãƒˆã€ã§ã™ã€‚ã‚¢ãƒ¡ãƒ•ãƒˆã®ã‚·ãƒ§ãƒƒãƒˆã‚¬ãƒ³ãƒ•ã‚©ãƒ¼ãƒ¡ãƒ¼ã‚·ãƒ§ãƒ³ã‚’ã¡ã‚‡ã£ã¨ã‚¤ãƒ¡ãƒ¼ã‚¸ã—ã¦ã¾ã™ã€‚ ã‚·ãƒ§ãƒƒãƒˆã‚¬ãƒ³ã‚½ãƒ¼ãƒˆã®ãƒ¡ãƒªãƒƒãƒˆ è¨ˆç®—é‡ãŒãŸã¶ã‚“O(1)ã€‚ã†ã‚ã©ã†ã—ã‚ˆã†ãªã‚“ã‹è³žã¨ã‹ã‚‚ã‚‰ã£ã¡ã‚ƒã£ãŸã‚‰ï¼ è¿½è¨˜ã€‚è¨ˆç®—ã€Œé‡ã€ã¯ç¢ºã‹ã«è¦ç´ æ•°ã«æ¯”ä¾‹ãªã®ã§O(n)ã§ã—ãŸã€‚ã§ã€è¨ˆç®—ã€Œæ™‚é–“ã€ãŒè¦ç´ æ•°ã«ã‚ˆã‚‰ãªã„ã‹ã‚‰O(1)ï¼Ÿè¨ˆç®—é‡ã¨è¨ˆç®—æ™‚é–“ã®ã‚ªãƒ¼ãƒ€ãƒ¼ãŒé•ã†ã¨ã“ã‚ãŒãƒã‚«ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ï¼Ÿ ã•ã•ã„ãªå•é¡Œç‚¹ ã‚½ãƒ¼ãƒˆã™ã‚‹æ•°ã®å¤§ãã•ã«ã‚ˆã‚Šæ™‚é–“ãŒã‹ã‹ã‚‹ã“ã¨ãŒã‚ã‚‹ã€‚ã§ã‚‚æ™‚é–“ãŒã‹ã‹ã£ã¦ã„ã‚‹é–“ã¯CPUè³‡æºã‚’å…¨ãæ¶ˆè²»ã—ãªã„ãŸã‚ã€ãã£ã¨ä»–ã®ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’èµ°ã‚‰ã›ã‚‰
ohnishiakira 2011/10/19
algorithm

ãƒã‚¿
ãƒªãƒ³ã‚¯
é »å‡ºå…¸åž‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®æ¼”ç¿’å•é¡Œã¨ã—ã¦ã‚ˆã•ã’ãªã‚„ã¤ - kyuridenamidaã®ãƒãƒ©è£
åŠ¹çŽ‡çš„ãªåˆ¥è§£ã¨ã‹å˜åœ¨ã™ã‚‹å•é¡Œã‚‚ã‚ã‚‹ã‘ã©æ¼”ç¿’ã«ã‚ˆã•ãã†ãªã‚„ã¤ã‚’ãƒ”ãƒƒã‚¯ã‚¢ãƒƒãƒ—ã€‚ãã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã˜ã‚ƒãªã„ã¨è§£ã‘ãªã„ã‚ã‘ã§ã¯ãªã„ã£ã¦å•é¡Œã‚‚å¤šã„ã®ã§æ³¨æ„ã€‚(ãŸã æ¼”ç¿’ã™ã‚‹ã®ã«ã¯éƒ½åˆãŒè‰¯ã„ã‹ãªã¨)â€»å€‹äººçš„é›£æ˜“åº¦ã‚’ã¤ã‘ã¦ã¿ã¾ã—ãŸã€‚ã¨ã¦ã‚‚ä¸»è¦³çš„ãªé›£æ˜“åº¦ä»˜ã‘ãªã®ã§æ°—ã«ã›ãšè§£ã„ã¦ã¿ã¦ãã ã•ã„ã€‚æ·±ã•å„ªå…ˆæŽ¢ç´¢ãƒ»Balls[â˜†]ãƒ»Sum of Integers[â˜†]ãƒ»The Number of Island[â˜†]ãƒ»Block[â˜…]å¹…å„ªå…ˆæŽ¢ç´¢ãƒ»Mysterious Worm[â˜…]ãƒ»Cheese[â˜…]ãƒ»Seven Puzzle[â˜…â˜†]ãƒ»Stray Twins[â˜…â˜…]ãƒ»Deven-Eleven[â˜…â˜…]ãƒ»Summer of Phyonkichi[â˜…â˜…â˜†]ãƒ¯ãƒ¼ã‚·ãƒ£ãƒ«ãƒ•ãƒã‚¤ãƒ‰æ³•(For å…¨ç‚¹å¯¾æœ€çŸè·¯å•é¡Œ)ãƒ»Traveling Alone: One-way Ticket of Youth[â˜…]ãƒ»A reward for a Car
ohnishiakira 2011/10/09
algorithm
ãƒªãƒ³ã‚¯
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®å‹‰å¼·ã®ã—ã‹ãŸ - ãã—ã ã®Hatena
ã“ã®è¨˜äº‹ã§ã€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®å‹‰å¼·ã¯ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚«ã‚¿ãƒã‚°ã‚’è¦šãˆã‚‹ã“ã¨ã˜ã‚ƒãªã„ã‚ˆã¨ã„ã†ã“ã¨ã‚’æ›¸ãã¾ã—ãŸã€‚ ãƒ—ãƒã‚°ãƒ©ãƒ ã®ç†è«–ã¨ã¯ãªã«ã‹ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®å‹‰å¼·ã¨ã„ã†ã®ã¯ã€ã‚¹ãƒãƒ¼ãƒ„ã§è¨€ãˆã°è…•ç«‹ã¦ä¼ã›ã‚„èµ°ã‚Šè¾¼ã¿ã¿ãŸã„ãªåŸºç¤Žä½“åŠ›ã‚’é¤Šã†ã‚ˆã†ãªã‚‚ã®ã§ã€ã€Œã‚½ãƒ¼ãƒˆãªã‚“ã‹å®Ÿéš›ã«è‡ªåˆ†ã§æ›¸ãã“ã¨ãªã„ã ã‚ã†ã€ã¨ã‹ã„ã†ã®ã¯ã€Œã‚µãƒƒã‚«ãƒ¼ã¯è…•ã¤ã‹ã‚ãªã„ã®ã«è…•ç«‹ã¦ã„ã‚‰ãªã„ã ã‚ã†ã€ã¨ã‹ã€Œé‡Žçƒã§1kmã‚‚èµ°ã‚‹ã“ã¨ãªã‚“ã‹ãªã„ã®ã«é•·è·é›¢ã®èµ°ã‚Šè¾¼ã¿ã„ã‚‰ãªã„ã ã‚ã†ã€ã¨ã‹è¨€ã†ã‚ˆã†ãªã‚‚ã®ã§ã™ã€‚ Twitterã§ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®å‹‰å¼·ã¨ã¯ãªã«ã‹ã¨å°‹ãã‚‰ã‚Œã¦ã€ã€Œã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®åŸºæœ¬çš„ãªãƒ‘ã‚¿ãƒ¼ãƒ³ã‚’çŸ¥ã£ã¦ã€ãã‚Œã‚‰ã®æ€§è³ªã®åˆ†æžã®ã—ã‹ãŸã‚’ã—ã£ã¦ã€ã„ã‚ã„ã‚ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã©ã®ã‚ˆã†ã«å¿œç”¨ã•ã‚Œã¦ã„ã‚‹ã‹çŸ¥ã£ã¦ã€è‡ªåˆ†ãŒçµ„ã‚€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®æ€§è³ªã‚’åˆ¤æ–ã§ãã‚‹ã‚ˆã†ã«ãªã‚‹ã“ã¨ã ã¨æ€ã„ã¾ã™ã€‚ ã€ã¨ç”ãˆãŸã®ã§ã™ãŒã€ã˜ã‚ƒã‚å®Ÿéš›ã©ã†ã„ã†æœ¬ã§å‹‰å¼·ã™ã‚Œã°ã„ã„ã‹ã€ã¼ãã®çŸ¥ã£ã¦ã‚‹æœ¬ã‹ã‚‰ã¾ã¨ã‚ã¦ã¿ã¾ã—ãŸã€‚
ohnishiakira 2011/09/22
algorithm
ãƒªãƒ³ã‚¯
STLé¢¨ã«ä½¿ãˆã‚‹ãƒžãƒƒãƒ—åž‹ã‚³ãƒ³ãƒ†ãƒŠã®ç´¹ä»‹ã¨æ€§èƒ½æ¯”è¼ƒ - Preferred Networks Tech Blog
æœ€è¿‘ã‚¹ãƒžãƒ¼ãƒˆãƒ•ã‚©ãƒ³ã«ä¹—ã‚Šæ›ãˆã¾ã—ãŸã€‚å¾³æ°¸ã§ã™ã€‚ C++ã¯ä¸–ã«æ•°ã‚ã‚‹ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°è¨€èªžã®ä¸ã§ã¯æ¯”è¼ƒçš„ãƒ¡ãƒ¢ãƒªã‚’é£Ÿã‚ãªã„æ–¹ã§ã™ãŒã€ãã‚Œã§ã‚‚ãƒ¡ãƒ¢ãƒªä½¿ç”¨é‡ãŒå•é¡Œã¨ãªã‚‹å ´åˆã¯ã‚ã‚Šã¾ã™ã€‚ãã®ã‚ˆã†ãªå ´åˆã®å¯¾å‡¦æ–¹æ³•ã¯ã„ãã¤ã‹æœ‰ã‚Šã¾ã™ãŒã€æ‰‹è»½ã«é¸æŠžã§ãã‚‹æ–¹æ³•ã¨ã—ã¦ã€ä»Šæ—¥ã¯STLã®mapã‚„unordered_mapã¨åŒã˜æ„Ÿã˜ã§ä½¿ãˆã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚’ã„ãã¤ã‹ç´¹ä»‹ã—ãŸã„æ€ã„ã¾ã™ã€‚ ä»¥ä¸‹ã€è¨ˆç®—é‡ã®è¡¨è¨˜ã‚’ã™ã‚‹éš›ã«ã¯ã€è¦ç´ æ•°ã‚’nã¨ã—ã¾ã™ã€‚ Loki::AssocVector Lokiã¯Modern C++ Designã¨ã„ã†æœ¬ã®ä½œè€…ã§ã‚ã‚‹Andrei AlexandrescuãŒé–‹ç™ºã—ãŸãƒ©ã‚¤ãƒ–ãƒ©ãƒªã§ã™ã€‚AssocVectorã¯ãã®ä¸ã®ä¸€ã¤ã¨ã—ã¦æä¾›ã•ã‚Œã¦ã„ã‚‹ã‚¯ãƒ©ã‚¹ã§ã€vector<pair<key, value> >ã¨ã„ã†åž‹ã®ãƒ™ã‚¯ã‚¿ãƒ¼ã‚’keyã§ã‚½ãƒ¼ãƒˆã—ãŸçŠ¶æ…‹ã§æŒã¤äº‹ã«ã‚ˆã‚Šã€äºŒåˆ†æŽ¢ç´¢ã«ã‚ˆã‚‹è¦ç´ ã®æŽ¢ç´¢ã‚’å¯èƒ½ã«ã—ãŸãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã™ã€‚ã“
ohnishiakira 2011/07/20
algorithm
ãƒªãƒ³ã‚¯
ã‚½ãƒ•ãƒˆãªæŽ¨è«–Markov Logic Networkã®ç´¹ä»‹ - Preferred Networks Research & Development
äºˆç´„ã—ãŸã‚‚ã®ã®ã‚¤ãƒ³ãƒ•ã‚©ãƒãƒ¼ã‚’æ‰‹ã«å…¥ã‚Œã‚‰ã‚Œãªã„æµ·é‡Žã§ã™ï¼Ž äººé–“ã®é«˜åº¦ãªçŸ¥çš„å‡¦ç†ã®ä¸€ã¤ãŒã€æŽ¨è«–å‡¦ç†ã§ã™ï¼Žä»Šæ—¥ã¯ãã®æŽ¨è«–ã‚’ã€è¿°èªžè«–ç†ã¨æ©Ÿæ¢°å¦ç¿’ã®çµ„ã¿åˆã‚ã›ã§æ¨¡å€£ã—ãŸMarkov Logic Networkã¨ã„ã†æ‰‹æ³•ã¨ã€ãã®OSSå®Ÿè£…ã§ã‚ã‚‹Alchemyã®ç´¹ä»‹ã§ã™ï¼Ž é³¥ã¨ã¯ãªã‚“ã§ã™ã‹ï¼Ÿã¨ã„ã†è³ªå•ã«å¯¾ã—ã¦ã©ã†ç”ãˆã‚‹ã§ã—ã‚‡ã†ã‹ï¼Žå¤§é›‘æŠŠã«ã¯ã€ä»¥ä¸‹ã®ã‚ˆã†ã«è€ƒãˆã‚‹ã§ã—ã‚‡ã†ï¼Ž é³¥ã¨ã¯ã€ç©ºã‚’é£›ã¶å‹•ç‰©ã§ã™ï¼Ž ã“ã®å›žç”ã«å¯¾ã—ã¦ã€ã€Œãƒšãƒ³ã‚®ãƒ³ã¯é£›ã°ãªã„ã‚ˆã€ã¨åè«–ã™ã‚‹äººãŒã„ã‚‹ã‹ã‚‚çŸ¥ã‚Œã¾ã›ã‚“ï¼Ž é³¥ã¨ã¯ã€ãã¡ã°ã—ã‚’æŒã£ãŸå‹•ç‰©ã§ã™ï¼Ž ã™ã‚‹ã¨ã€ã€Œã‚«ãƒ¢ãƒŽãƒã‚·ã¯é³¥ã˜ã‚ƒãªã„ã‚ˆã€ã¨è¨€ã‚ã‚Œã‚‹ã§ã—ã‚‡ã†ï¼Žäººé–“ã¯åˆã‚ã¦è¦‹ãŸç”Ÿãç‰©ãŒé³¥ã‹ãã†ã˜ã‚ƒãªã„ã‹åˆ¤æ–ã™ã‚‹ã¨ãã€ã©ã†ã—ã¦ã„ã‚‹ã®ã§ã—ã‚‡ã†ã‹ï¼Žæ€ã†ã«ã€å°‘æ•°ã®è¦å‰‡ï¼ˆé£›ã¶ã‹ã©ã†ã‹ï¼Žãã¡ã°ã—ã‚’ã‚‚ã¤ã‹ï¼‰ã‹ã‚‰ç·åˆçš„ã«åˆ¤æ–ã—ã¦ã„ã‚‹ã‚ˆã†ã«æ€ã‚ã‚Œã¾ã™ï¼Žäººé–“ã®æŽ¨è«–ã¨ã„ã†ã®ã¯æ¦‚ãä»¥ä¸‹ã®ã‚ˆã†ãªç‰¹å¾´ã‚’æŒã£ã¦ã„ã‚‹ã®ã§ã¯ãªã„ã‹ã¨
ohnishiakira 2011/07/06
æ©Ÿæ¢°å¦ç¿’

algorithm
ãƒªãƒ³ã‚¯
MapReduceä»¥å¤–ã®åˆ†æ•£å‡¦ç†åŸºç›¤BSP, Piccolo, Sparkã®ç´¹ä»‹ - Preferred Networks Tech Blog
ã©ã†ã‚‚ï¼Œå®Ÿã¯ä»Šå¹´ã‹ã‚‰é–‹ç™ºãƒãƒ¼ãƒ ã«joinã—ã¦ã„ãŸä¸å·ã§ã™ï¼Žå¯æ„›ã„çŠ¬ã®å†™çœŸãŒãªã‹ã£ãŸã®ã§ï¼Œå¯æ„›ã„ãƒžã‚¹ã‚³ãƒƒãƒˆã®ç”»åƒã‚’è²¼ã£ã¦ãŠãã¾ã™ï¼Ž æœ€è¿‘MapReduceã¨ã‹ãã®å®Ÿè£…ã§ã‚ã‚‹Hadoopã¨ã‹ã‚’ã‚ˆãèžãã‚ˆã†ã«ãªã‚Šã¾ã—ãŸï¼Žã“ã‚Œã¯ã¤ã¾ã‚Šï¼Œãã‚Œã ã‘å¤§é‡ã®ãƒ‡ãƒ¼ã‚¿ã‚’ãªã‚“ã¨ã‹å‡¦ç†ã—ãŸã„ã¨ã„ã†è¦æœ›ãŒã‚ã‚‹ã‹ã‚‰ã ã¨æ€ã„ã¾ã™ï¼Žã—ã‹ã—å½“ãŸã‚Šå‰ã§ã™ãŒï¼ŒMapReduceã¯éŠ€ã®å¼¾ä¸¸ã§ã¯ã‚ã‚Šã¾ã›ã‚“ï¼Ž ã¨ã„ã†ã“ã¨ã§ï¼Œæœ€è¿‘æ°—ã«ãªã£ã¦ã„ã‚‹MapReduceã¨ã¯é•ã£ãŸã‚¢ãƒ—ãƒãƒ¼ãƒã‚’å–ã£ã¦ã„ã‚‹åˆ†æ•£å‡¦ç†åŸºç›¤ã«ã¤ã„ã¦ï¼Œç¤¾å†…ã®TechTalkã§è©±ã—ãŸå†…å®¹ã‚’ç°¡å˜ã«ã¾ã¨ã‚ã¦ç´¹ä»‹ã—ãŸã„ã¨æ€ã„ã¾ã™ï¼Ž Bulk Sychronous Parallel ã“ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ è‡ªä½“ã¯1990å¹´ã«èª•ç”Ÿã—ãŸã‚‚ã®ã§ã™ï¼Žé•·ã„ã®ã§BSPã¨æ›¸ãã¾ã™ï¼Žã•ã¦ï¼Œã‚°ãƒ©ãƒ•ã‹ã‚‰æœ€çŸçµŒè·¯ã‚’æ±‚ã‚ã‚‹æ™‚ï¼ŒMapReduceã¯ä½¿ãˆã‚‹ã§ã—ã‚‡ã†ã‹ï¼Ÿã“ã®ã‚ˆã†ãªè«–æ–‡ãŒå‡ºã‚‹ãã‚‰ã„ã§ã™ã‹ã‚‰å‡ºæ¥ãªã„ã“ã¨ã¯ã‚
ohnishiakira 2011/06/18
algorithm

åˆ†æ•£å‡¦ç†
ãƒªãƒ³ã‚¯
ç·¨é›†è·é›¢ (Levenshtein Distance) - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
æ˜¨æ—¥ æœ€é•·å…±é€šéƒ¨åˆ†åˆ—å•é¡Œ (LCS) ã«ã¤ã„ã¦è§¦ã‚Œã¾ã—ãŸã€‚ã¤ã„ã§ãªã®ã§ç·¨é›†è·é›¢ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦ã‚‚æ•´ç†ã—ã¦ã¿ã¾ã™ã€‚ ç·¨é›†è·é›¢ (ãƒ¬ãƒ¼ãƒ™ãƒ³ã‚·ãƒ¥ã‚¿ã‚¤ãƒ³è·é›¢, Levenshtein Distance) ã¯äºŒã¤ã®æ–‡å—åˆ—ã®é¡žä¼¼åº¦ (ç•°ãªã‚Šå…·åˆ) ã‚’å®šé‡åŒ–ã™ã‚‹ãŸã‚ã®æ•°å€¤ã§ã™ã€‚æ–‡å—ã®æŒ¿å…¥/å‰Šé™¤/ç½®æ›ã§ä¸€æ–¹ã‚’ä»–æ–¹ã«å¤‰å½¢ã™ã‚‹ãŸã‚ã®æœ€å°æ‰‹é †å›žæ•°ã‚’æ•°ãˆãŸã‚‚ã®ãŒç·¨é›†è·é›¢ã§ã™ã€‚ ä¾‹ãˆã° ä¼Šè—¤ç›´å“‰ã¨ä¼Šè—¤ç›´ä¹Ÿ â€¦ ç·¨é›†è·é›¢ 1 ä¼Šè—¤ç›´ã¨ä¼Šè—¤ç›´ä¹Ÿ â€¦ ç·¨é›†è·é›¢ 1 ä½è—¤ç›´å“‰ã¨ä¼Šè—¤ç›´ä¹Ÿ â€¦ ç·¨é›†è·é›¢ 2 ä½è—¤Bä½œã¨ä¼Šè—¤ç›´ä¹Ÿ â€¦ ç·¨é›†è·é›¢ 3 ã¨ã„ã†å…·åˆã§ã™ã€‚ ç·¨é›†è·é›¢ã¯ã‚¹ãƒšãƒ«ãƒŸã‚¹ã‚’ä¿®æ£ã™ã‚‹ãƒ—ãƒã‚°ãƒ©ãƒ ã‚„ã€è¿‘ä¼¼æ–‡å—åˆ—ç…§åˆ (æ¤œç´¢å¯¾è±¡ã®æ–‡æ›¸ã‹ã‚‰å…¥åŠ›æ–‡å—ã«ã‚ã‚‹ç¨‹åº¦è¿‘ã„éƒ¨åˆ†æ–‡å—åˆ—ã‚’æŽ¢ã—å‡ºã™å…¨æ–‡æ¤œç´¢) ãªã©ã§åˆ©ç”¨ã•ã‚Œã¾ã™ã€‚ ç·¨é›†è·é›¢ç®—å‡ºã¯å‹•çš„è¨ˆç”»æ³• (Dynamic Programming, DP) ã§è¨ˆç®—ã™ã‚‹ã“ã¨ãŒã§ãã‚‹ã“ã¨ãŒ
ohnishiakira 2011/06/13
algorithm
ãƒªãƒ³ã‚¯
ãƒ¬ãƒ¼ãƒ™ãƒ³ã‚·ãƒ¥ã‚¿ã‚¤ãƒ³è·é›¢ã¨N-gramãƒ¢ãƒ‡ãƒ«ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€‚ãã‚Œã¯æ“¬ä¼¼Google Suggestã£ã½ã„ä½•ã‹ã€‚ - Bug Catharsis
ãã£ã‹ã‘ã¯ ãƒ¬ãƒ¼ãƒ™ãƒ³ã‚·ãƒ¥ã‚¿ã‚¤ãƒ³è·é›¢ - shin5papaã®æ—¥è¨˜ http://d.hatena.ne.jp/shin5papa/20090311/1236745197 ãƒ¬ãƒ¼ãƒ™ãƒ³ã‚·ãƒ¥ã‚¿ã‚¤ãƒ³è·é›¢ã¨N-gramãƒ¢ãƒ‡ãƒ«ã§ã€æ“¬ä¼¼çš„ãªGoogle Suggestãƒ¬ãƒ¼ãƒ™ãƒ³ã‚·ãƒ¥ã‚¿ã‚¤ãƒ³è·é›¢ã‚’ä½¿ã†ã“ã¨ã«ã‚ˆã£ã¦ã€æ“¬ä¼¼çš„ã«Googleå…ˆç”Ÿã®ã€Œã‚‚ã—ã‹ã—ã¦ã€ã¨ã‹ã€ Google Suggestã£ã½ã„ã“ã¨ãŒã§ããã†ã‹ãªãƒ¼ã¨æ€ã£ã¦ã€é¢ç™½ãã†ãªã®ã§ãŠå‹‰å¼·ã—ã¦ã¿ãŸã€‚ PHPã§ã¯æ¨™æº–ã§é–¢æ•°ãŒã‚ã‚‹ã®ã‹ãƒ¼ã€‚ã‚“ãƒ¼ã€é¢ç™½ã„ã§ã™ãã‚³ãƒ¬ã€‚ã¨ã„ã†ã“ã¨ã§ã€ã•ã£ããC#ã§æ›¸ã„ã¦ã¿ã‚‹ã“ã¨ã«ã—ã¾ã—ãŸã€‚ ãŸã ã€ã“ã®ãƒ¬ãƒ¼ãƒ™ãƒ³ã‚·ãƒ¥ã‚¿ã‚¤ãƒ³è·é›¢ã®ã¿ã®åˆ¤å®šã ã‘ã§ã¯ã€è·é›¢ãŒç‰ã—ã„çµæžœãŒè¤‡æ•°ã‚ã‚‹ã‚ˆã†ãªå ´åˆã®çµæžœãŒã€ ã‚¤ãƒžã‚¤ãƒç´å¾—ã®ã‚†ãã‚‚ã®ã«ã¯ãªã‚‰ãªã‹ã£ãŸã®ã§ã€æ›´ã« N-gram *1ã«ã‚ˆã‚‹å…±èµ·é »åº¦ã§ã®åˆ¤å®šã‚‚ä½µç”¨ã™ã‚‹ã“ã¨ã«ã—ã¾ã—ãŸã€‚ Wikipedia - ãƒ¬ãƒ¼ãƒ™
ohnishiakira 2011/06/13
algorithm

n-gram

NLP

C#
ãƒªãƒ³ã‚¯
ãƒ¬ãƒ¼ãƒ™ãƒ³ã‚·ãƒ¥ã‚¿ã‚¤ãƒ³è·é›¢ã®æ±‚ã‚æ–¹ã«ã¤ã„ã¦æ•™ãˆã¦ãã ã•ã„ã€‚ - ãƒ¬ãƒ¼ãƒ™ãƒ³ã‚·ãƒ¥ã‚¿ã‚¤ãƒ³è·é›¢ã‚’æ±‚ã‚ã‚‹éŽç¨‹ã§ã€ã€Œæ–‡å—ã®æŒ¿å…¥ã€ã€Œæ–‡å—ã®å‰Šé™¤ã€ã€Œ... - Yahoo!çŸ¥æµè¢‹
ç§ã¯ã“ã®è³ªå•ã‚’è¦‹ã‚‹ã¾ã§ãƒ¬ãƒ¼ãƒ™ãƒ³ã‚·ãƒ¥ã‚¿ã‚¤ãƒ³è·é›¢ã«ã¤ã„ã¦çŸ¥ã‚Šã¾ã›ã‚“ã§ã—ãŸãŒã€ http://ja.wikipedia.org/wiki/%E3%83%AC%E3%83%BC%E3%83%99%E3%83%B3%E3%82%B7%E3%83%A5%E3%82%BF%E3%82%A4%E3%83%B3%E8%B7%9D%E9%9B%A2 ã‚’å‚è€ƒã«ã—ãªãŒã‚‰ã‚„ã£ã¦ã¿ã¾ã™ã€‚ apple ã¨ play ã®ãƒ¬ãƒ¼ãƒ™ãƒ³ã‚·ãƒ¥ã‚¿ã‚¤ãƒ³è·é›¢ã‚’æ±‚ã‚ã¦ã¿ã¾ã™ã€‚ ã“ã®ã¨ãã«ã€ä»¥ä¸‹ã®ã‚ˆã†ãªè¡¨ã‚’ä½œæˆã—ã¾ã™ã€‚ ............................. "" ........................ "p" ........................... "pl" ............................ "pla" ............................. "pl
ohnishiakira 2011/06/13
algorithm
ãƒªãƒ³ã‚¯
http://www.merriampark.com/ld.htm
ohnishiakira 2011/06/12
algorithm
ãƒªãƒ³ã‚¯
4chan BBS - Genius sorting algorithm: Sleep sort
1 Name: Anonymous : 2011-01-20 12:22 Man, am I a genius. Check out this sorting algorithm I just invented. #!/bin/bash function f() { sleep "$1" echo "$1" } while [ -n "$1" ] do f "$1" & shift done wait example usage: ./sleepsort.bash 5 3 6 3 6 3 1 4 7 2 Name: Anonymous : 2011-01-20 12:27 >>1 Oh god, it works. But I don't like to wait 218382 seconds to sort '(0 218382)
ohnishiakira 2011/05/19
algorithm

ãƒã‚¿
ãƒªãƒ³ã‚¯
Googleã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 200é …ç›®å…¨ã¦ã‚’ç‰¹åˆ¥å…¬é–‹ | ãƒ•ã‚©ãƒ¼ãƒ‡ã‚¶ã‚¤ãƒ³
Googleã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®200ã®è¦ç´ ã‚’ç™ºè¦‹ã—ã¾ã—ã‚‡ã†ï¼ï¼ˆLetâ€™s Try to Find All 200 Parameters in GoogleÂ Algorithmï¼‰ ã¯2009å¹´ã«æ›¸ã‹ã‚ŒãŸè¨˜äº‹ã§ã™ãŒã€ãƒ‘ãƒ³ãƒ€ã‚¢ãƒƒãƒ—ãƒ‡ãƒ¼ãƒˆãŒé©ç”¨ã•ã‚ŒãŸä»Šç¾åœ¨ï¼ˆ2011å¹´4æœˆï¼‰ã§ã‚‚é‡è¦é …ç›®ãŒå¤šãæ›¸ã‹ã‚Œã¦ã„ã‚‹ã‚‚ã®ã§ã€‚ å¤šãã¯Googleã®ç‰¹è¨±ï¼ˆåˆè¡†å›½ç‰¹è¨±å‡ºé¡˜0050071741ï¼‰ã«åŸºã¥ã„ã¦ã„ã¾ã™ãŒã€ç†è€…ã®ã‚¢ãƒ³ãŒè‡ªèº«ã®è§£æžçµæžœã‚„äºˆæ¸¬ã‚’ç››ã‚Šè¾¼ã‚“ã§ã„ã‚‹äº‹ã§ã€ã‚ˆã‚Šå®Ÿè·µã«è¿‘ã„å†…å®¹ã«ãªã£ã¦ã„ã¾ã™ã€‚ SEOåˆå¿ƒè€…ã®æ–¹ã¯ã€ã“ã‚Œã‹ã‚‰ã®ã‚¦ã‚§ãƒ–åˆ¶ä½œã®è»¸ã«ã€SEOã‚¨ã‚ã‚¹ãƒ‘ãƒ¼ãƒˆã®æ–¹ã¯ã‚‚ã†ä¸€åº¦è‡ªèº«ã®ã‚µã‚¤ãƒˆã‚’è¦‹ç›´ã™ç›®æ¬¡ã¨ã—ã¦ç¢ºèªã—ã¦ã¿ã¦ã¯ã„ã‹ãŒã§ã—ã‚‡ã†ã‹ã€‚ ãƒ‰ãƒ¡ã‚¤ãƒ³ã«é–¢ã™ã‚‹13è¦å› ãƒ‰ãƒ¡ã‚¤ãƒ³å¹´é½¢ ãƒ‰ãƒ¡ã‚¤ãƒ³å–å¾—ã‹ã‚‰ã®é•·ã• ãƒ‰ãƒ¡ã‚¤ãƒ³ç™»éŒ²æƒ…å ±ï¼ˆWho isæƒ…å ±ï¼‰ã®è¡¨ç¤º/éžè¡¨ç¤º ãƒ‰ãƒ¡ã‚¤ãƒ³ç¨®é¡žï¼ˆã‚µã‚¤ãƒˆãƒ¬ãƒ™ãƒ«ãƒ‰ãƒ¡ã‚¤ãƒ³ï¼ˆ.com ã‚„ co.ukï¼‰ ãƒˆ
ohnishiakira 2011/04/21
Google

æ¤œç´¢

algorithm
ãƒªãƒ³ã‚¯
1 2 3 4 5 6 æ¬¡ã®ãƒšãƒ¼ã‚¸