[B! Algorithm] nozomã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

nozom id:nozom

Algorithmã«é–¢ã™ã‚‹nozomã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (39)

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

Locality Sensitive Hashing ã«æŒ‘ã‚“ã§ã¿ãŸ - download_takeshiâ€™s diary
ä¹…ã€…ã®ã‚¨ãƒ³ãƒˆãƒªã§ã™ã€‚ Locality Sensitive Hashing ã‚’ perl ã§ä½¿ã†ãŸã‚ã®ãƒ¢ã‚¸ãƒ¥ãƒ¼ãƒ«ã‚’æ›¸ã„ã¦ã¿ã¾ã—ãŸã€‚Algorithm::LSHã¨åä»˜ã‘ã¾ã—ãŸã€‚ å…ˆã»ã©Developer Releaseã¨ã—ã¦CPANã«ã‚ã’ã¾ã—ãŸãŒã€åæ˜ ã•ã‚Œã‚‹ã¾ã§æ™‚é–“ã‹ã‹ã‚‹ã®ã§ã€èˆˆå‘³ã‚ã‚‹æ–¹ã¯codereposã‹ã‚‰ã¿ã¦ãã ã•ã„ã€‚ Algorithm::LSH CPAN: http://search.cpan.org/~miki/Algorithm-LSH/ coderepos: http://coderepos.org/share/browser/lang/perl/Algorithm-LSH è¶…ã‚¢ãƒ«ãƒ•ã‚¡ãƒãƒ¼ã‚¸ãƒ§ãƒ³ãªçŠ¶æ…‹ã§ã™ãŒã€ãã®ã†ã¡githubã«ã‚‚upã™ã‚‹äºˆå®šã€‚ ãã†ãã†ã€ãã†è¨€ãˆã° WEB+DB PRESS Vol.49 ã«ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ‰ã‚¨ãƒ³ã‚¸ãƒ³ã®ç‰¹é›†ãŒã‚ã£ã¦ã€ãã®ä¸ã«å¶ç„¶ã«ã‚‚Locality
nozom 2009/12/24
Perl

Algorithm
ãƒªãƒ³ã‚¯
æ¯”è¼ƒçš„å¼·å›ºãªãƒ©ã‚¤ã‚»ãƒ³ã‚¹ã‚ãƒ¼ã®ç”Ÿæˆ - kaisehã®ãƒ–ãƒã‚°
ãƒ—ãƒã‚°ãƒ©ãƒ ã®ãƒã‚¤ãƒŠãƒªè‡ªä½“ãŒæ”¹ã–ã‚“ã•ã‚Œã‚‹å¯èƒ½æ€§ã‚’ç„¡è¦–ã—ã¦ã€è§£æžãƒ»å½è£…ãŒå›°é›£ãªãƒ©ã‚¤ã‚»ãƒ³ã‚¹ã‚ãƒ¼ã‚’ç”Ÿæˆ/æ¤œè¨¼ã™ã‚‹æ‰‹æ³•ã¨ã„ã†ã¨ã€ã‚„ã£ã±ã‚Šä»¥ä¸‹ã®ã‚ˆã†ãªå…¬é–‹éµæš—å·æ–¹å¼ã«ãªã‚‹ã‚“ã ã‚ã†ã‹ã€‚ RSAã®ã‚ãƒ¼ãƒšã‚¢ã‚’ä½œæˆã—ã¦ãŠãã€‚ ç®¡ç†è€…å´ã¯ã€Œãƒ—ãƒã‚°ãƒ©ãƒ å›ºæœ‰ã®æƒ…å ±ï¼‹ãƒ¦ãƒ¼ã‚¶å›ºæœ‰ã®æƒ…å ±ã€ã‚’ç§˜å¯†éµã§æš—å·åŒ–ã—ã¦ãƒ©ã‚¤ã‚»ãƒ³ã‚¹ã‚ãƒ¼ã¨ã™ã‚‹ã€‚ 1024ãƒ“ãƒƒãƒˆã®éµã®å ´åˆã€ãƒ‘ãƒ‡ã‚£ãƒ³ã‚°ã®88ãƒ“ãƒƒãƒˆã‚’å¼•ã„ã¦936ãƒ“ãƒƒãƒˆ=117ãƒã‚¤ãƒˆã‚’å›ºæœ‰æƒ…å ±ã®è¨˜è¿°ã«ä½¿ç”¨å¯èƒ½ã€‚ãƒ¦ãƒ¼ã‚¶åã¨ãƒ¡ãƒ¼ãƒ«ã‚¢ãƒ‰ãƒ¬ã‚¹ç¨‹åº¦ã®æƒ…å ±ã¯æ ¼ç´ã™ã‚‹ã“ã¨ãŒã§ãã‚‹ã€‚ ã“ã®å ´åˆã€ãƒ©ã‚¤ã‚»ãƒ³ã‚¹ã‚ãƒ¼ã®é•·ã•ã‚‚1024ãƒ“ãƒƒãƒˆã«ãªã‚‹ã€‚ã“ã‚Œã‚’Base64ã§ã‚¨ãƒ³ã‚³ãƒ¼ãƒ‰ã™ã‚Œã°172æ–‡å—ã®ã‚ãƒ¼ã«ãªã‚‹ã€‚Base16ãªã‚‰256æ–‡å—ã€‚ ãƒ—ãƒã‚°ãƒ©ãƒ å´ã«ã¯å…¬é–‹éµã‚’åŸ‹ã‚è¾¼ã‚“ã§ãŠãã€‚ ãƒ¦ãƒ¼ã‚¶ãŒå…¥åŠ›ã—ãŸãƒ©ã‚¤ã‚»ãƒ³ã‚¹ã‚ãƒ¼ã‚’å…¬é–‹éµã§å¾©å·åŒ–ã—ã¦æ¤œè¨¼ã™ã‚‹ã€‚ ä»¥ä¸‹ã¯ãƒ©ã‚¤ã‚»ãƒ³ã‚¹ã‚ãƒ¼ç”Ÿæˆéƒ¨ã®ã‚µãƒ³ãƒ—ãƒ«ã€‚ import java.math.Big
nozom 2008/09/18
Algorithm
ãƒªãƒ³ã‚¯
ä¸¦è¡Œåˆ†æ•£ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ï¼ä¸¦åˆ—åˆ†æ•£ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ 2005å¹´
ã“ã®ãƒšãƒ¼ã‚¸ã¯ã€ç‘æ³¢å¤§å¦ï¼ ã‚·ã‚¹ãƒ†ãƒ æƒ…å ±å·¥å¦ç ”ç©¶ç§‘ï¼ ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿ã‚µã‚¤ã‚¨ãƒ³ã‚¹å°‚æ”» ãŠã‚ˆã³ã€ ç†å·¥å¦ç ”ç©¶ç§‘ï¼ ç†å·¥å¦å°‚æ”» ã‚’å¯¾è±¡ã¨ã—ãŸè¬›ç¾©ã€ä¸¦è¡Œåˆ†æ•£ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ï¼ä¸¦åˆ—åˆ†æ•£ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã®ãŸã‚ã®ãƒšãƒ¼ã‚¸ã§ã™ã€‚ æ‹…å½“æ•™å®˜ï¼šæ–°åŸŽ é–(ã—ã‚“ã˜ã‚‡ã† ã‚„ã™ã—)ã€è¿½å· ä¿®ä¸€(ãŠã„ã‹ã‚ ã—ã‚…ã†ã„ã¡) ç§‘ç›®ç•ªå·ï¼šã‚·ã‚¹ãƒ†ãƒ æƒ…å ±å·¥å¦ç ”ç©¶ç§‘ ä¸¦è¡Œåˆ†æ•£ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ 02CC020, 01CC305 ç§‘ç›®ç•ªå·ï¼šç†å·¥å¦ç ”ç©¶ç§‘ ä¸¦åˆ—åˆ†æ•£ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ 01D1562 å¦æœŸï¼šï¼“å¦æœŸ æ›œæ™‚é™ï¼šé‡‘æ›œæ—¥ï¼“ã€ï¼” æ•™å®¤ï¼šï¼“ï¼¡ï¼”ï¼‘ï¼ â– ã‚·ãƒ©ãƒã‚¹ï¼ˆã‚·ã‚¹ãƒ†ãƒ æƒ…å ±å·¥å¦ç ”ç©¶ç§‘ï¼ä¸¦è¡Œåˆ†æ•£ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ï¼‰ â– ãƒ¬ãƒãƒ¼ãƒˆ â– ãƒ‘ã‚¹ãƒ¯ãƒ¼ãƒ‰ç”Ÿæˆ â– æŽˆæ¥å†…å®¹ãƒ¡ãƒ¢ 2005å¹´12æœˆ02æ—¥ ä¸¦è¡Œãƒ»ä¸¦åˆ—ãƒ»åˆ†æ•£ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã¨ã¯ 2005å¹´12æœˆ09æ—¥ ãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰ãƒ»ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°(1) 2005å¹´12æœˆ16æ—¥ ãƒžãƒ«ãƒã‚¹ãƒ¬ãƒƒãƒ‰ãƒ»ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°(2) 2005å¹´12æœˆ22æ—¥ ãƒž
nozom 2008/04/19
Algorithm

Parallel
ãƒªãƒ³ã‚¯
ãƒ–ãƒ«ãƒ¼ãƒ ãƒ•ã‚£ãƒ«ã‚¿ - Wikipedia
ã“ã®é …ç›®ã§ã¯ã€ç¢ºçŽ‡çš„ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«ã¤ã„ã¦èª¬æ˜Žã—ã¦ã„ã¾ã™ã€‚ç”»åƒã«ã¼ã‹ã—åŠ¹æžœã‚’ä»˜åŠ ã™ã‚‹ç”»åƒãƒ•ã‚£ãƒ«ã‚¿ã«ã¤ã„ã¦ã¯ã€Œå·ç€¬ã®ãƒ–ãƒ«ãƒ¼ãƒ ãƒ•ã‚£ãƒ«ã‚¿ãƒ¼ã€ã‚’ã”è¦§ãã ã•ã„ã€‚ ãƒ–ãƒ«ãƒ¼ãƒ ãƒ•ã‚£ãƒ«ã‚¿ï¼ˆè‹±èªž: Bloom filterï¼‰ã¯ã€1970å¹´ã« Burton H. Bloom ãŒè€ƒæ¡ˆã—ãŸç©ºé–“åŠ¹çŽ‡ã®è‰¯ã„ç¢ºçŽ‡çš„ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã‚ã‚Šã€ã‚ã‚‹ãƒ‡ãƒ¼ã‚¿ãŒé›†åˆã®è¦ç´ ã§ã‚ã‚‹ï¼ˆé›†åˆã«å«ã¾ã‚Œã¦ã„ã‚‹ï¼‰ã‹ã©ã†ã‹ã®åˆ¤å®šã«ä½¿ã‚ã‚Œã‚‹ã€‚ãŸã ã—åˆ¤å®šã¯æ£ç¢ºã§ã¯ãªãã¦ã€å«ã¾ã‚Œã¦ã„ãªã„ã®ã«å«ã¾ã‚Œã¦ã„ã‚‹ã¨èª¤ã£ã¦åˆ¤å®šã™ã‚‹ã“ã¨å½é™½æ€§ï¼ˆfalse positiveï¼‰ã®å¯èƒ½æ€§ãŒã‚ã‚‹ã€‚ã—ã‹ã—å«ã¾ã‚Œã¦ã„ã‚‹ã‚‚ã®ã‚’å«ã¾ã‚Œã¦ã„ãªã„ã¨èª¤åˆ¤å®šã™ã‚‹ã“ã¨å½é™°æ€§ï¼ˆfalse negativeï¼‰ã¯ãªã„ã€‚ãªãŠé›†åˆã«è¦ç´ ã‚’è¿½åŠ ã™ã‚‹ã“ã¨ã¯ã§ãã‚‹ãŒã€é›†åˆã‹ã‚‰è¦ç´ ã‚’å‰Šé™¤ã™ã‚‹ã“ã¨ã¯ã§ããªã„ï¼ˆãŸã ã—ã€æ‹¡å¼µã‚’ã—ãŸ counting filter ã§ã‚ã‚Œã°å‰Šé™¤ã‚‚ã§ãã‚‹ï¼‰ã€‚é›†åˆã«è¦ç´ ã‚’è¿½åŠ ã—ã¦ã„ãã«ã¤ã‚Œã¦å½é™½æ€§ã®
nozom 2007/11/06
Algorithm
ãƒªãƒ³ã‚¯
Parsing Expression Grammar - Wikipedia
Parsing Expression Grammarï¼ˆPEGï¼‰ã¯ã€åˆ†æžçš„å½¢å¼æ–‡æ³•ã®ä¸€ç¨®ã§ã‚ã‚Šã€å½¢å¼è¨€èªžã‚’ãã®è¨€èªžã«å«ã¾ã‚Œã‚‹æ–‡å—åˆ—ã‚’èªè˜ã™ã‚‹ãŸã‚ã®ä¸€é€£ã®è¦å‰‡ã‚’ä½¿ã£ã¦è¡¨ã—ãŸã‚‚ã®ã§ã‚ã‚‹ã€‚PEGã¯å†å¸°ä¸‹é™æ§‹æ–‡è§£æžã‚’æ–‡æ³•ã‚’ç¤ºã™ãŸã‚ã ã‘ã«ç´”ç²‹ã«å›³å¼çš„ã«è¡¨ç¾ã—ãŸã‚‚ã®ã¨è¦‹ã‚‹ã“ã¨ã‚‚ã§ãã€å…·ä½“çš„ãªæ§‹æ–‡è§£æžå™¨ã®å®Ÿè£…ã‚„ãã®ç”¨é€”ã¨ã¯ç‹¬ç«‹ã—ã¦ã„ã‚‹ã€‚ PEGã«ãŠã‘ã‚‹æ§‹æ–‡ï¼ˆæ–‡æ³•ï¼‰ã®å®šç¾©ã¯æ–‡è„ˆè‡ªç”±æ–‡æ³•ã®ãƒãƒƒã‚«ã‚¹ãƒ»ãƒŠã‚¦ã‚¢è¨˜æ³•ã«ã‚ˆã‚‹ãã‚Œã«ä¼¼ã¦ã„ã‚‹ãŒã€æ–‡è„ˆè‡ªç”±æ–‡æ³•ã§ã¯ä¸€èˆ¬ã«ã€Œï½œã€ï¼ˆç¸¦æ£’ã€ãƒãƒ¼ãƒ†ã‚£ã‚«ãƒ«ãƒãƒ¼ï¼‰ã§è¡¨ã•ã‚Œã‚‹ã€Œã“ã‚Œã‚‰ã®ã†ã¡ã©ã‚Œã‹ã€ã§ã¯ãªãã€ã€Œæœ€åˆã®è§£æžãŒã†ã¾ãã„ã£ãŸã‚‰ãã‚Œã‚’ã€å¤±æ•—ãªã‚‰æ¬¡ã‚’é †ã«è©¦ã—ã¦ã‚†ãã€æˆåŠŸã—ãŸã‚‚ã®ã‚’æŽ¡ç”¨ã€ï¼ˆã€Œ/ã€ã§ã‚ã‚‰ã‚ã™ï¼‰ã¨ã„ã†æ„å‘³ã‚’ä½¿ã†ã€‚ ã“ã®ãŸã‚ã€æ–‡è„ˆè‡ªç”±æ–‡æ³•ã¨ã¯ç•°ãªã‚Šã€PEGã«ã¯æ›–æ˜§ã•ã¯å˜åœ¨ã—ãªã„ã€‚æ–‡å—åˆ—ã‚’æ§‹æ–‡è§£æžã™ã‚‹å ´åˆã€æ£ã—ã„æ§‹æ–‡æœ¨ã¯å¸¸ã«1ã¤ã—ã‹ãªã„ã€‚ã“ã®ãŸã‚PEGã¯ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿è¨€èªžã®æ§‹æ–‡è§£æž
nozom 2007/08/21
Algorithm

Text
ãƒªãƒ³ã‚¯
binomial tree
nozom 2007/03/13
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ã¨ã™ã‚‹)ãŒå‡ºç¾ã—ãŸã¨ãã«å¯¾å¿œ
nozom 2007/02/20
wikipedia

Algorithm
ãƒªãƒ³ã‚¯
ã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆ - Wikipedia
ã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆï¼ˆè‹±: skip listï¼‰ã¯ã€å¹³è¡¡äºŒåˆ†æŽ¢ç´¢æœ¨ã¨ä¼¼ãŸç”¨é€”ã«ä½¿ã†ä¹±æŠžã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã€‚é€£çµãƒªã‚¹ãƒˆã‚’ä¸¦åˆ—ã«é€£çµã•ã›ã¦ä½œã‚‹ã€‚æ¯”è¼ƒã«ã‚ˆã‚Šé †åºã¥ã‘å¯èƒ½ãªè¦ç´ ã‚’æŒ¿å…¥ã—ã€ã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆå†…ã§ã¯ã‚½ãƒ¼ãƒˆã•ã‚ŒãŸçŠ¶æ…‹ã§ä¿æŒã•ã‚Œã‚‹ã€‚ã‚½ãƒ¼ãƒˆã•ã‚ŒãŸé€£æƒ³é…åˆ—ã‚„é›†åˆã®å®Ÿè£…ãªã©ã«ä½¿ãˆã‚‹ã€‚æŒ¿å…¥ã¨æŽ¢ç´¢ã¨å‰Šé™¤ã¯å¹³å‡O(log n)ã§ã‚ã‚‹ã€‚1989å¹´ã«ã‚¦ã‚£ãƒªã‚¢ãƒ ãƒ»ãƒ”ãƒ¥ãƒ¼ãŒç™ºè¡¨ã—ãŸ[1][2][3][4]ã€‚ ã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆã¯é †åºã¤ãã®é€£çµãƒªã‚¹ãƒˆã®å‰å‘ãã®é£›ã³è¶Šã—ã®ãƒªãƒ³ã‚¯ã‚’è¿½åŠ ã—ãŸã‚‚ã®ã§ã‚ã‚‹ã€‚ãƒŽãƒ¼ãƒ‰ã¯å¹¾ä½•åˆ†å¸ƒã‚„è² ã®äºŒé …åˆ†å¸ƒã«ã¦ãƒ©ãƒ³ãƒ€ãƒ ã«é«˜ã•ã‚’è¨å®šã—ã¦è¿½åŠ ã•ã‚Œï¼ˆé«˜ã•1ãŒç¢ºçŽ‡50%ã€é«˜ã•2ãŒ25%ã€é«˜ã•3ãŒ12.5%ãªã©ï¼‰ã€ãƒªã‚¹ãƒˆä¸Šã®æŽ¢ç´¢ã«ãŠã„ã¦é€£çµãƒªã‚¹ãƒˆã®ä¸€éƒ¨ã‚’é«˜é€Ÿã«é£›ã°ã™ã“ã¨ãŒã§ãã‚‹ã€‚ ã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆã®ä¾‹ã€‚1ã€œ10ã‚’è¿½åŠ ã—ã€ã‚½ãƒ¼ãƒˆã•ã‚ŒãŸçŠ¶æ…‹ã§ä¿æŒã•ã‚Œã¦ã„ã‚‹ã€‚ ã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆã¯ãƒªã‚¹ãƒˆã®éšŽå±¤ã«ãªã£ã¦ã„ã‚‹ã€‚æœ€ä¸‹å±¤ã¯é€šå¸¸ã®
nozom 2007/02/14
Wikipedia

Algorithm
ãƒªãƒ³ã‚¯
Rabin-Karp string search algorithm - Wikipedia, the free encyclopedia
In computer science, the Rabinâ€“Karp algorithm or Karpâ€“Rabin algorithm is a string-searching algorithm created by Richard M. Karp and Michael O. RabinÂ (1987) that uses hashing to find an exact match of a pattern string in a text. It uses a rolling hash to quickly filter out positions of the text that cannot match the pattern, and then checks for a match at the rem aining positions. Generalizations o
nozom 2006/12/27
Algorithm

Wikipedia
ãƒªãƒ³ã‚¯
Algorithm-RabinKarp-0.41
Modification of t/util.t to make it more compatible with perl 5.6 -- Some of the tests failed because I forgot that the special form for opening a string as a file handle was only recently introduced in 5.8
nozom 2006/12/27
Rabin-Karp streaming hash

Perl

CPAN

Algorithm
ãƒªãƒ³ã‚¯
E.W.Dijkstra Archive: Transcriptions
A group of volunteers is undertaking to transcribe the EWDs and other documents to simple HTML files, in order to make them both searchable and accessible to the visually impaired. If you might be interested in lending a hand in this effort, please read this. The transcriptions completed so far, and those in progress, are indexed here:
nozom 2006/12/10
ã‚ã¨ã§èªã‚€

Algorithm

Words
ãƒªãƒ³ã‚¯
www.hizum.net is Expired or Suspended.
nozom 2006/12/06
PostScript

Algorithm
ãƒªãƒ³ã‚¯
Perl ã§é…åˆ—ã‚’ã‚·ãƒ£ãƒƒãƒ•ãƒ«
Landscape ãƒˆãƒƒãƒ—ãƒšãƒ¼ã‚¸ | < å‰ã®æ—¥ 2004-11-12 2004-11-13 æ¬¡ã®æ—¥ 2004-11-14 > Landscape - ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã®ãƒ¡ãƒ¢Â 2004-11-13 Perl ã§é…åˆ—ã‚’ã‚·ãƒ£ãƒƒãƒ•ãƒ« å½“ã‚µã‚¤ãƒˆå†…ã‚’ Google æ¤œç´¢ã§ãã¾ã™ * Perl ã§é…åˆ—ã‚’ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã“ã®è¨˜äº‹ã®ç›´ãƒªãƒ³ã‚¯URL: Permlink | ã“ã®è¨˜äº‹ãŒå±žã™ã‚‹ã‚«ãƒ†ã‚´ãƒª: [Perl] Perl ã§é…åˆ—ã‚’ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã™ã‚‹æ–¹æ³•ã€‚Perl ã‚¯ãƒƒã‚¯ãƒ–ãƒƒã‚¯ã«ã€Œé…åˆ—ã®ãƒ©ãƒ³ãƒ€ãƒžã‚¤ã‚ºã€ã¨ã—ã¦è¼‰ã£ã¦ãŸã‘ã©ãƒ¡ãƒ¢ã€‚è‡ªåˆ†ã®ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã«ã‚‚ã‚ã‚‹ã‘ã©ã€ãƒ–ãƒ©ã‚¦ã‚¶ã‹ã‚‰ã•ãã£ã¨ã‚³ãƒ”ãƒ¼ & ãƒšãƒ¼ã‚¹ãƒˆã§ãã¨ä¾¿åˆ©ã ã—ãã€‚ mixi perlãªã‚‰ã§ã¯ã®ä¾¿åˆ©ãªçŸã„ã‚³ãƒ¼ãƒ‰ã‚’æ›¸ãç•™ã‚ãŸã„ http://mixi.jp/view_bbs.pl?id=2041 2004å¹´11æœˆ12æ—¥ 15:03 32: ã‚ã¨ã‚€ #===============
nozom 2006/12/06
Perl

Algorithm
ãƒªãƒ³ã‚¯
SeditionÂ·com is under the knife
nozom 2006/12/06
Perl

Javascript

Algorithm
ãƒªãƒ³ã‚¯
ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®çµ‚äº†æ—¥ã‚’2020å¹´1æœˆ31æ—¥(é‡‘)ã«æ±ºå®šã—ã¾ã—ãŸ - ã¯ã¦ãªã®å‘ŠçŸ¥
ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®çµ‚äº†æ—¥ã‚’2020å¹´1æœˆ31æ—¥(é‡‘)ã«æ±ºå®šã—ã¾ã—ãŸ ä»¥ä¸‹ã®ã‚¨ãƒ³ãƒˆãƒªã®é€šã‚Šã€ä»Šå¹´æœ«ã‚’ç›®å‡¦ã«ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã‚’çµ‚äº†äºˆå®šã§ã‚ã‚‹æ—¨ã‚’ãŠçŸ¥ã‚‰ã›ã—ã¦ãŠã‚Šã¾ã—ãŸã€‚ 2019å¹´æœ«ã‚’ç›®å‡¦ã«ã€ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®æä¾›ã‚’çµ‚äº†ã™ã‚‹äºˆå®šã§ã™ - ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—æ—¥è¨˜ ã“ã®ãŸã³ã€æ£å¼ã«çµ‚äº†æ—¥ã‚’æ±ºå®šã„ãŸã—ã¾ã—ãŸã®ã§ã€ä»¥ä¸‹ã®é€šã‚Šã”ç¢ºèªãã ã•ã„ã€‚ çµ‚äº†æ—¥: 2020å¹´1æœˆ31æ—¥(é‡‘) ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆå¸Œæœ›ç”³è«‹æœŸé™:2020å¹´1æœˆ31æ—¥(é‡‘) çµ‚äº†æ—¥ä»¥é™ã¯ã€ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã®é–²è¦§ãŠã‚ˆã³æŠ•ç¨¿ã¯è¡Œãˆã¾ã›ã‚“ã€‚æ—¥è¨˜ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆãŒå¿…è¦ãªæ–¹ã¯ä»¥ä¸‹ã®è¨˜äº‹ã«ã—ãŸãŒã£ã¦æ‰‹ç¶šãã‚’ã—ã¦ãã ã•ã„ã€‚ ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—ã«æŠ•ç¨¿ã•ã‚ŒãŸæ—¥è¨˜ãƒ‡ãƒ¼ã‚¿ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆã«ã¤ã„ã¦ - ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—æ—¥è¨˜ ã”åˆ©ç”¨ã®ã¿ãªã•ã¾ã«ã¯ã”è¿·æƒ‘ã‚’ãŠã‹ã‘ã„ãŸã—ã¾ã™ãŒã€ã©ã†ãžã‚ˆã‚ã—ããŠé¡˜ã„ã„ãŸã—ã¾ã™ã€‚ 2020-06-25 è¿½è¨˜ ã¯ã¦ãªã‚°ãƒ«ãƒ¼ãƒ—æ—¥è¨˜ã®ã‚¨ã‚¯ã‚¹ãƒãƒ¼ãƒˆãƒ‡ãƒ¼ã‚¿ã¯2020å¹´2æœˆ28
nozom 2006/12/06
Perl

Javascript

Algorithm
ãƒªãƒ³ã‚¯
é…åˆ—ã‚’ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã™ã‚‹
nozom 2006/12/06
Javascript

Algorithm
ãƒªãƒ³ã‚¯
JavaScriptã§é…åˆ—ã‚’ã‚·ãƒ£ãƒƒãƒ•ãƒ«
é…åˆ—ã‚’ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã€ã¤ã¾ã‚Šãƒ©ãƒ³ãƒ€ãƒ ã«è¦ç´ ã®ä½ç½®ã‚’å…¥ã‚Œæ›¿ãˆã‚‹ã¨ã„ã†ã®ã‚’ã€sortãƒ¡ã‚½ãƒƒãƒ‰ã‚’ä½¿ã£ã¦ã‚„ã£ã¦ã¿ãŸã®ã ã‘ã©ã€æ˜Žã‚‰ã‹ã«ãƒ€ãƒ¡ãƒ€ãƒ¡ãªã‚‚ã®ã«ãªã£ã¦ã—ã¾ã£ãŸã€‚ãã®å¾Œã€ã‚ãƒ¼ã§ã‚‚ãªã„ã“ãƒ¼ã§ã‚‚ãªã„ã¨è€ƒãˆãŸã®ã ã‘ã©ã€ç®—æ•°ãŒå¾—æ„ã™ãŽã¦é ãŒç—›ããªã£ãŸã€‚ã¨ã„ã†ã“ã¨ã‚’æŸæ‰€ã§ã¼ã‚„ã„ãŸã‚‰ã¯ã¦ã®ãã‚“ãŒã‚³ãƒ¼ãƒ‰ã‚’è¦‹ã¤ã‘ã¦ãã‚ŒãŸã€‚ã©ã†ã‚„ã‚‰Fisher-Yatesã¨ã„ã†æœ‰åãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã‚„ã‚‹ã¨è‰¯ã„ã‚‰ã—ã„ã€‚ æœ€åˆã«æ›¸ã„ãŸã‚³ãƒ¼ãƒ‰ã¯ã€ var a = new Array(0, 1, 2, 3, 4, 5, 6, 7, 8, 9); a.sort( function (a, b) { return Math.ceil(Math.random() * 3) - 2; } ); ã¨ã„ã†ã‚‚ã®ã€‚sortãƒ¡ã‚½ãƒƒãƒ‰ã¯ã€ãƒ‘ãƒ©ãƒ¡ãƒ¼ã‚¿ã«ä¸Žãˆã‚‰ã‚ŒãŸé–¢æ•°ãŒè² ã®å€¤ãƒ»0ãƒ»æ£ã®å€¤ã‚’è¿”ã™ã“ã¨ã«ã‚ˆã£ã¦è¦ç´ ã®é †åºã‚’æ±ºå®šã™ã‚‹ã®ã§ã€ãã®é–¢æ•°ãŒãƒ©ãƒ³ãƒ€ãƒ ã«å€¤ã‚’è¿”ã›ã°ãƒ©ãƒ³ãƒ€
nozom 2006/12/06
Javascript

Algorithm
ãƒªãƒ³ã‚¯
æœ€é€Ÿã‚¤ãƒ³ã‚¿ãƒ¼ãƒ•ã‚§ãƒ¼ã‚¹ç ”ç©¶ä¼š :: å®Ÿè·µJavaScriptã§é…åˆ—ã‚’ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã™ã‚‹æ–¹æ³•ãƒªãƒ•ã‚¡ã‚¯ã‚¿ãƒªãƒ³ã‚°
JavaScriptã§é…åˆ—ã‚’ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã™ã‚‹è©±ã‚’è¦‹ã¦ã€ãã†ã„ãˆã°Array#shuffleã¯ä»¥å‰æ›¸ã„ãŸè¨˜æ†¶ãŒã‚ã‚‹ãªãƒ¼ã¨æ€ã£ã¦èª¿ã¹ã¦ã¿ãŸã‚‰ã‚³ãƒ”ãƒšã ã£ãŸã€‚ http://www.fumiononaka.com/TechNotes/Flash/FN0212002.html Fisher-Yatesã¨ã„ã†ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã ãã†ã§ã™ã€‚ Array.prototype.shuffle = function() { var i = this.length; while(i){ var j = Math.floor(Math.random()*i); var t = this[--i]; this[i] = this[j]; this[j] = t; } return this; } a = [1,2,3,4,5]; a.shuffle() // 3,1,5,2,4 a // 3,1,5,2,4 ã”ãæ™®é€šã«å®Ÿè£…
nozom 2006/12/06
Javascript

Algorithm
ãƒªãƒ³ã‚¯
javascript - ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã‚·ãƒ£ãƒƒãƒ•ãƒ« : 404 Blog Not Found
2006å¹´08æœˆ30æ—¥18:30 ã‚«ãƒ†ã‚´ãƒªLightweight Languages javascript - ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã‚·ãƒ£ãƒƒãƒ•ãƒ« ãªã‚‹ã»ã©ã€‚Schwartzian Transf ormã®æ„å¤–ãªåˆ©ç”¨æ³•ã ãªã‚ã€‚ snippets from shinichitomitaâ€™s journal - JavaScriptã®é…åˆ—ã‚’sorté–¢æ•°ã§ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã™ã‚‹ Array.prototype.shuffle = function() { return this.map(function(a){ return { weight: Math.random(), value: a } }) .sort(function(a, b){ return a.weight - b.weight }) .map(function(a){ return a.value }); } ã§ã‚‚ã€å®Ÿè·µã§ã¯ã©ã†ã ã‚ã†ã€‚èª¿ã¹ã¦ã¿ãŸã€‚
nozom 2006/12/06
Javascript

Algorithm
ãƒªãƒ³ã‚¯
JavaScriptã®é…åˆ—ã‚’sorté–¢æ•°ã§ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã™ã‚‹ - snippets from shinichitomitaâ€™s journal
ã‚ãˆã¦sorté–¢æ•°ã‚’ä½¿ã†æ–¹æ³•ã§ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã—ã¦ã¿ã‚‹ã€‚æ¯”è¼ƒé–¢æ•°è‡ªä½“ãŒãƒ©ãƒ³ãƒ€ãƒ ãªå€¤ã‚’è¿”ã™å ´åˆã¨é•ã£ã¦ã€ã“ã‚Œãªã‚‰åã‚‰ãªã„ã€‚ Array.prototype.shuffle = function() { return this.map(function(a){ return { weight: Math.random(), value: a } }) .sort(function(a, b){ return a.weight - b.weight }) .map(function(a){ return a.value }); }ã¨ã‚Šã‚ãˆãšFirefox1.5ã§OKã€‚IEã§ã‚‚mapé–¢æ•°ã‚’è‡ªåˆ†ã§å®šç¾©ã—ã¦ã‚„ã‚Œã°å¤§ä¸ˆå¤«ã®ã¯ãšã€‚ ç½®æ›ã«ã‚ˆã‚‹ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã¨é•ã£ã¦ã€weightå€¤ã®ã¨ã“ã‚ã‚’é©å½“ã«å¤‰åŒ–ã•ã›ã‚Œã°ã€è¦ç´ ã”ã¨ã«é‡ã¿ã¥ã‘ã¦ã®ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã‚‚ã§ãã‚‹ã¨æ€ã†ã€‚ãŸã¨ãˆã°ã‚ˆãèžãæ›²ã¯å„ªå…ˆçš„ã«å‰ã®æ–¹ã«æŒã£ã¦ãã‚‹ã¨ã‹ã€ãã®é€†ã¨
nozom 2006/12/06
Javascript

Algorithm
ãƒªãƒ³ã‚¯
1 2 æ¬¡ã®ãƒšãƒ¼ã‚¸