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

todesking id:todesking

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

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

äººå·¥ç„¡è„³ã¯è€ƒãˆã‚‹
äººå·¥ç„¡è„³ã¯æ°—è»½ã«ã€Œã‚‰ã—ã•ã€ã‚’æ¥½ã—ã‚€ã“ã¨ãŒã§ãã‚‹ã€çŸ¥èƒ½ã‚’æŒãŸãªã„ä¼šè©±ãƒ—ãƒã‚°ãƒ©ãƒ ã§ã™ã€‚ã—ã‹ã—äººå·¥ç„¡è„³ã¨ã®ä¼šè©±ã¯ã¨ãã¨ã—ã¦ã€è«–ç†ã§å›ºã‚ã‚‰ã‚ŒãŸäººå·¥çŸ¥èƒ½ãŒæŒã¡å¾—ãªã‹ã£ãŸäººé–“ã‚‰ã—ã• â€• å³èˆˆã€ã„ãŸãšã‚‰å¿ƒã€æ„Ÿæƒ… â€• ã‚’ç§ãŸã¡ã«æ„Ÿã˜ã•ã›ã¦ãã‚Œã¾ã™ã€‚ãã®æ„å‘³ã§ã¯çŸ¥èƒ½ã®æœ¬è³ªã‚’è¿½æ±‚ã™ã‚‹ãŸã‚ã®åˆ¥ã®åˆ‡ã‚Šå£ãªã®ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ã€‚ã“ã®ã‚ˆã†ãªãƒãƒžãƒ³ã‚’è¿½ã„æ±‚ã‚ã¦æ—¥é ƒã¨ã‚Šã¨ã‚ã‚‚ãªãè€ƒãˆã‚‹é›‘è«‡çš„ãƒˆãƒ”ãƒƒã‚¯ã‚’ã¾ã¨ã‚ã¦ã¿ã¾ã—ãŸã€‚ æœ€è¿‘ã®è¨˜äº‹ã‚ˆã‚Š åŽ³é¸ãŠã™ã™ã‚ï¼†äººæ°—æ›¸ç± 2008/09/28â– è‡ªæˆ‘çŠ¶æ…‹ã‚’è€ƒæ…®ã—ãŸäººå·¥ç„¡è„³ - è¿½è¨˜ äººå·¥ç„¡è„³ã¯ä¼šè©±ã®ä¸ã§ãƒ¦ãƒ¼ã‚¶ã«ä¸è‡ªç„¶ã•ã‚’æ„Ÿã˜ã•ã›ã€ä¼šè©±ãŒç¶šã‹ãªã‹ã£ãŸã‚Šã€æ‹’çµ¶ã•ã‚Œã‚‹ã¨ã„ã†ç‚¹ãŒèª²é¡Œã¨ãªã£ã¦ã„ã‚‹ã€‚ã“ã®åŽŸå› ã®ä¸€ã¤ã«äººå·¥ç„¡è„³ã®å°è±¡ã‚„ãƒ ãƒ¼ãƒ‰ãŒã§ãŸã‚‰ã‚ã«å¤‰åŒ–ã—å®‰å®šã—ã¦ã„ãªã„ã“ã¨ãŒæŒ™ã’ã‚‰ã‚Œã‚‹ã€‚ä¸€æ–¹ã€äººã¯é€šå¸¸æ„è˜ã™ã‚‹ã“ã¨ãªãç›¸æ‰‹ã«ä¸é©åˆ‡ãªãƒ¡ãƒƒã‚»ãƒ¼ã‚¸ãŒä¼ã‚ã‚‹ã“ã¨ã‚’é¿ã‘ã¦ã†ã¾ãã‚³ãƒŸãƒ¥ãƒ‹ã‚±ãƒ¼ã‚·ãƒ§ãƒ³ã‚’ã¯ã‹ã£ã¦ã„ã‚‹ã€‚
todesking 2009/04/06
algorithm
ãƒªãƒ³ã‚¯
ALGORITHM NOTE
XÃ—Yå€‹ã®ã‚»ãƒ«ã‹ã‚‰æˆã‚‹ã‚°ãƒªãƒƒãƒ‰ä¸Šã®ã‚¹ã‚¿ãƒ¼ãƒˆåœ°ç‚¹ã‹ã‚‰å‡ºç™ºã—ã€å…¨ï¼•ç¨®é¡žã®ãƒ‘ãƒã‚¯ãƒªï¼ˆç”Ÿç‰©ï¼‰ã‚’æ•ã¾ãˆãŸçŠ¶æ…‹ã§ã‚´ãƒ¼ãƒ«åœ°ç‚¹ã¾ã§è¡Œãæœ€çŸã‚³ã‚¹ãƒˆã‚’æ±‚ã‚ã‚‹å•é¡Œã§ã™ã€‚å„ãƒ‘ãƒã‚¯ãƒªã¯ãã‚Œãžã‚Œã€ç«ã€æ°·ã€æœ¨ã€åœŸã€æ°´ã®å±žæ€§ã‚’æŒã¡ã€ç«ã®ãƒ‘ãƒã‚¯ãƒªã¯æ°·ã®ãƒ‘ãƒã‚¯ãƒªã‚’æ•ã¾ãˆã‚‹ã“ã¨ãŒã§ãã€æ°·ã®ãƒ‘ãƒã‚¯ãƒªã¯æœ¨ã®ãƒ‘ãƒã‚¯ãƒªã‚’æ•ã¾ãˆã‚‹ã“ã¨ãŒã§ãã€ã¨ã„ã£ãŸã‚ˆã†ã«ç«â†’æ°·â†’æœ¨â†’åœŸâ†’æ°´â†’ç«ã¨ã„ã†ã‚ˆã†ãªå±žæ€§ã®é–¢é€£ãŒã‚ã‚Šã¾ã™ã€‚ã‚¹ã‚¿ãƒ¼ãƒˆåœ°ç‚¹ã§æœ€åˆã«æŒã¤ãƒ‘ãƒã‚¯ãƒªã‚’ï¼‘ã¤é¸ã¶ã“ã¨ãŒã§ãã¾ã™ã€‚ã‚°ãƒªãƒƒãƒ‰ã®ã‚µã‚¤ã‚ºx, y ã¯ãã‚Œãžã‚Œ2ä»¥ä¸Š1000ä»¥ä¸‹ã§ã€å„å±žæ€§ã®ãƒ‘ãƒã‚¯ãƒªã®æ•°ã¯ãã‚Œãžã‚Œ0ä»¥ä¸Š1000ä»¥ä¸‹ã§ã™ï¼ˆå…¨ä½“ã®æ•°ã¯5000ä»¥ä¸‹ï¼‰ã€‚ æœ€åˆã«ï¼‘ã¤ã®ãƒ‘ãƒã‚¯ãƒªã‚’é¸ã‚“ã å¾Œã®ãƒ‘ãƒã‚¯ãƒªã‚’æ•ã¾ãˆã‚‹é †ç•ªã¯ã€ä¸Šè¨˜å±žæ€§ã®é–¢é€£ã®é †ç•ªã«ãªã‚Šã¾ã™ã€‚ä¾‹ãˆã°æœ€åˆã«ç«ã®å±žæ€§ã‚’ã‚‚ã¤ãƒ‘ãƒã‚¯ãƒªã‚’æŒã£ã¦ã„ã‚Œã°ã€æ°·ã€æœ¨ã€åœŸã€æ°´ã®å±žæ€§ã‚’ã‚‚ã¤ãƒ‘ãƒã‚¯ãƒªã‚’é †ç•ªã«æ•ã¾ãˆã¦ã‚´ãƒ¼ãƒ«ã«è¡Œã‘ã°ã‚ˆã„ã®ã§ã€ä¸‹å›³ã«ç¤ºã™DAGï¼ˆDi
todesking 2008/09/02
algorithm
ãƒªãƒ³ã‚¯
Longest common subsequence - Wikipedia
Comparison of two revisions of an example file, based on their longest common subsequence (black) A longest common subsequence (LCS) is the longest subsequence common to all sequences in a set of sequences (often just two sequences). It differs from the longest common substring: unlike substrings, subsequences are not required to occupy consecutive positions within the original sequences. The prob
todesking 2008/04/28
LCS(Longest Common Subsequence)ã€diff

algorithm
ãƒªãƒ³ã‚¯
Prediction by Partial Matching - Wikipedia
Prediction by Partial Matching(PPM)ã¯1984å¹´ã«J.G.Clearyã¨I.H.Wittenã«ã‚ˆã£ã¦è€ƒæ¡ˆã•ã‚ŒãŸãƒ‡ãƒ¼ã‚¿åœ§ç¸®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®1ã¤ã€‚ ã“ã®æ”¹è‰¯ç‰ˆãŒ7-zipç‰ã«ç”¨ã„ã‚‰ã‚Œã¦ã„ã‚‹ã€‚éžå¸¸ã«é«˜ã„åœ§ç¸®çŽ‡ã®åé¢ã€åœ§ç¸®é€Ÿåº¦ã¯ã‹ãªã‚Šé…ããƒ¡ãƒ¢ãƒªã‚‚å¤šãæ¶ˆè²»ã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã‚ã‚‹ã€‚ ã“ã®äºœç¨®ã¨ã—ã¦PPMCã€PPMdã€PPMZç‰ãŒã‚ã‚‹ã€‚ aabacaabbaã¨ãƒ‡ãƒ¼ã‚¿ã‚’ç¬¦å·åŒ–ã—ãŸã¨ã—ã¦ã€æ¬¡ã«ã©ã®è¨˜å·ãŒå‡ºç¾ã™ã‚‹ã‹ã‚’çµ±è¨ˆçš„ã«äºˆæ¸¬ã™ã‚‹ã€‚ ã“ã®å ´åˆã€çµ±è¨ˆçš„ã«aã®æ¬¡ã«ã¯aãŒå‡ºç¾ã™ã‚‹å¯èƒ½æ€§ãŒé«˜ã„ã€‚é€†ã«cãŒå‡ºç¾ã™ã‚‹å¯èƒ½æ€§ã¯ä½Žã„ã§ã‚ã‚ã†ã€‚ã“ã®ã‚ˆã†ã«å‡ºç¾ç¢ºçŽ‡ã«åã‚ŠãŒã‚ã‚‹ã¨ãƒãƒ•ãƒžãƒ³ç¬¦å·ã‚„ç®—è¡“ç¬¦å·ã§åœ§ç¸®ã™ã‚‹ã“ã¨ãŒå‡ºæ¥ã‚‹ã€‚ ã—ã‹ã—ã€ä¸Šè¨˜ã®å ´åˆã«æ¬¡ã«å‡ºç¾ã™ã‚‹ç¬¦å·ã‚’aã‚’50%ã€bã‚’40%ã€cã‚’10%ã¨äºˆæ¸¬ã—ãŸã¨ã™ã‚‹ã¨ã€ä»–ã®è¨˜å·ã¯çµ¶å¯¾ã«ç¾ã‚Œãªã„ã¨ã„ã†ã“ã¨ã«ãªã‚Šã€æ–°ãŸãªè¨˜å·(dã¨ã™ã‚‹)ãŒå‡ºç¾ã—ãŸã¨ãã«å¯¾å¿œ
todesking 2007/02/14
algorithm

ã‚ã¨ã§
ãƒªãƒ³ã‚¯
æ–‡æ›¸æ¯”è¼ƒï¼ˆdiffï¼‰ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
æ–‡æ›¸æ¯”è¼ƒï¼ˆdiffï¼‰ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å‰ã®ãƒ‰ã‚ãƒ¥ãƒ¡ãƒ³ãƒˆ æ¬¡ã®ãƒ‰ã‚ãƒ¥ãƒ¡ãƒ³ãƒˆ ï¼¶ï½‰ï¼¶ï½‰ã®æ–‡æ›¸æ¯”è¼ƒï¼ˆdiffï¼‰æ©Ÿèƒ½ã§ä½¿ç”¨ã—ã¦ã„ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦è§£èª¬ã™ã‚‹ã€‚ ã“ã‚Œã‚‰ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ Myers æ°ã‚‰ã®è«–æ–‡ã«ã‚ˆã‚‹ã‚‚ã®ã§ã€æ°ã¯ç†è€…ã®ãŸã‚ã«ã‚ã–ã‚ã–è«–æ–‡ã‚’ï¼·ï½…ï½‚ã‚µã‚¤ãƒˆã§å…¥æ‰‹å¯èƒ½ãªå½¢å¼ã«ã—ã¦ãã ã•ã£ãŸã€‚ã“ã®å ´ã‚’å€Ÿã‚Šã¦ãŠç¤¼ç”³ã—ä¸Šã’ã‚‹ã€‚ ã‚ªãƒªã‚¸ãƒŠãƒ«è«–æ–‡ã¯ä»¥ä¸‹ã®ï¼·ï½…ï½‚ã‚µã‚¤ãƒˆã‹ã‚‰å…¥æ‰‹å¯èƒ½ã§ã‚ã‚‹ã€‚ http://www.cs.arizona.edu/people/gene [1] E.W.Myers, "An O(ND) Difference Algorithm and Its Variations", Algorithmica, 1 (1986), pp.251-266 [2] S. Wu, U. Manber, G. Myers and W. Miller, "An O(NP) Sequence Comparis
todesking 2006/11/22
æ–‡æ›¸æ¯”è¼ƒã®

algorithm
ãƒªãƒ³ã‚¯
The Aggregate Magic Algorithms
There are lots of people and places that create and collect algorithms of all types (here are a few WWW sites). Unfortunately, in building systems hardware and software, we in The Aggregate often have found it necessary to do relatively obscure low-level things very efficiently. Many of the tricks we've devised or collected either require assem bly language coding or are not entirely porta ble when
todesking 2006/11/04
algorithm
ãƒªãƒ³ã‚¯
åˆä»£Googleã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ è§£èª¬ - GIGAZINE
ã„ã¾ã‚„ãƒãƒƒãƒˆã®ä¸–ç•Œã‚’å·¦å³ã™ã‚‹å¼·åŠ›ãªæ¤œç´¢ã‚¨ãƒ³ã‚¸ãƒ³ã¨ãªã£ãŸGoogleã€‚æ—¥æœ¬ã§ã¯ã¾ã Yahooï¼ã®æ–¹ãŒã¯ã‚‹ã‹ã«åˆ©ç”¨è€…ãŒå¤šã„ã®ã§ã•ã»ã©ã§ã¯ãªã„ã§ã™ãŒã€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®åŸºæœ¬çš„ãªè€ƒãˆãŒä¼¼ã¦ã„ã‚‹ãŸã‚ã€åŒã˜ã‚ˆã†ãªçµæžœãŒå‡ºã¦ãã¾ã™ã€‚ã¤ã¾ã‚Šã€æ—¢å˜ã®æ¤œç´¢ã‚¨ãƒ³ã‚¸ãƒ³ã®ãã®åŸºç¤Žã¨ãªã£ãŸä¸€ç•ªæœ€åˆã®Googleã®æ¤œç´¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ç†è§£ã™ã‚Œã°ã€æ¤œç´¢ã‚¨ãƒ³ã‚¸ãƒ³å¯¾ç–ã«ã‚‚å½¹ç«‹ã¤ã¯ãšã€‚ ã¨ã„ã†ã“ã¨ã§ã€åˆä»£Googleã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ã§ãã‚‹ã ã‘ã‚ã‹ã‚Šã‚„ã™ãè§£èª¬ã—ã¦ã¿ã¾ã™ã€‚æ—¢å˜ã®ä»–ã‚µã‚¤ãƒˆã®è§£èª¬ã¨ã¯é•ã„ã€ãã¡ã‚“ã¨ã—ãŸæœ€åˆã®Googleã®æ•°å¼ã«åŸºã¥ã„ã¦ã„ã¾ã™ã€‚ è©³ç´°ã¯ä»¥ä¸‹ã‹ã‚‰ã€‚The Anatomy of a Search Engine http://www-db.stanford.edu/~backrub/google.html Googleã®ç”»æœŸçš„ãªãƒ©ãƒ³ã‚¯ä»˜ã‘ã®æ–¹æ³•ãŒæ•°å¼ã«ã‚ˆã‚‹å…¨è‡ªå‹•ã®ãƒšãƒ¼ã‚¸ãƒ©ãƒ³ã‚¯ã¨ã„ã†ã®ã¯èžã„ãŸã“ã¨ãŒã‚ã‚‹ã¨æ€ã„ã¾ã™ãŒã€
todesking 2006/04/12
æƒ…å ±ç§‘å¦

algorithm
ãƒªãƒ³ã‚¯
OBB vs AABB - Radium Software Development
iPhoneã®ä¸€èˆ¬ä¿®ç†åº—ã¯äºˆç´„ãªã—ã§ã‚‚æ¥åº—ã§ãã‚‹ï¼Ÿ åŸºæœ¬çš„ã«ã¯é£›ã³è¾¼ã¿ã§ä¿®ç†ã«è¡Œã£ã¦ã‚‚OK iPhoneã‚’ç½®ã„ã¦ã„ãŸã‚½ãƒ•ã‚¡ã«ã†ã£ã‹ã‚Šã¨è…°ã‹ã‘ã¦ã—ã¾ã„ã€ãƒ‘ãƒãƒ«ã‚’å‰²ã£ã¦ã—ã¾ã£ãŸã€ã“ã‚“ãªæ™‚ã¯ã‚¹ãƒžãƒ›ã®ä¸€èˆ¬ä¿®ç†åº—ã¸è¡Œãã¾ã—ã‚‡ã†ã€‚ç”»é¢å‰²ã‚Œã¯ã€ã‚¹ãƒžãƒ›ã‚„ã‚¿ãƒ–ãƒ¬ãƒƒãƒˆã®æ•…éšœåŽŸå› ã¨ã—ã¦éžå¸¸ã«å¤šã„ã‚‚ã®ã§ã™ã€‚äºˆç´„ãªã—ã§çªç„¶ãŠåº—ã«è¡Œã£ã¦ã‚‚å¹³æ°—ã‹ã—ã‚‰ã¨ã€ä¸å®‰ã«æ€ã†æ–¹ã€…ã‚‚ã„ã‚‰ã£ã—ã‚ƒã‚‹ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ã€‚çµè«–ã¨ã—ã¦ã¯ç‰¹ã«å•é¡Œã¯ãªãã€äºˆç´„ãªã—ã§è¨ªå•ã—ã¦ã‚‚ç”»é¢å‰²ã‚Œã®ä¿®ç†ã¯ãŠé¡˜ã„ã§ãã¾ã™ã€‚ ãŸã ã—ä»–ã®ã‚µãƒ¼ãƒ“ã‚¹æ¥ã®ãŠåº—åŒæ§˜ã€äºˆç´„ãªã—ã®å ´åˆã€ãŠåº—ãŒæ··é›‘ã—ã¦ã„ã‚‹ã¨é †ç•ªå¾…ã¡ã‚’ã—ãªã‘ã‚Œã°ã„ã‘ãªã„ã§ã™ã€‚ç‰¹ã«ç¹ç››ã—ã¦ã„ã‚‹ã‚¹ãƒžãƒ›ä¿®ç†ã®ãŠåº—ã ã¨ã€è¡Œåˆ—ãŒåº—å†…ã§å‡ºæ¥ã¦ãŠã‚Šã€äºˆç´„ãªã—ã ã¨ã€è‡ªåˆ†ã®é †ç•ªãŒå·¡ã£ã¦ãã‚‹ã¾ã§é•·æ™‚é–“å¾…ãŸã•ã‚Œã‚‹å¯èƒ½æ€§ãŒã‚ã‚Šã¾ã™ã€‚å¹³æ—¥ã®æœã€æ˜¼ãªã‚‰åˆ©ç”¨å®¢ãŒå°‘ãªã„å ´åˆãŒå¤šãã€é£›ã³è¾¼ã¿ã§ã‚‚æ¯”è¼ƒã‚¹ãƒ ãƒ¼ã‚ºã«ä¿®ç†ãŒé ¼ã‚ã¾ã™ã€‚ äºˆç´„ã¯å…¥ã‚ŒãŸæ–¹ãŒæ™‚çŸã«ã€
todesking 2006/04/04
programming

ttk
ãƒªãƒ³ã‚¯
Andreas' practical language comparison
test solved, see link for source. Line counts where temporarily removed to discourage writing cryptic code, unless a better solution is found.
todesking 2006/03/04
major algorithm with various languages

programming

algorithm

ã‚ˆã¿ã‚‚ã®
ãƒªãƒ³ã‚¯
1