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

quodius id:quodius

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

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

è¦ç´ ã®æŒ¿å…¥ã€å‰Šé™¤ã€ãƒ©ãƒ³ãƒ€ãƒ ã‚¢ã‚¯ã‚»ã‚¹ãŒå…¨éƒ¨é«˜é€Ÿãªãƒªã‚¹ãƒˆã‚’ä½œã£ãŸ - kaisehã®ãƒ–ãƒã‚°
ã‚¹ã‚ãƒƒãƒ—ãƒªã‚¹ãƒˆï¼ˆSkip Listï¼‰ã¯1990å¹´ã«ç™ºè¡¨ã•ã‚ŒãŸæ¯”è¼ƒçš„æ–°ã—ã„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã€è¦ç´ ã®æŒ¿å…¥ã‚„å‰Šé™¤ã€æ¤œç´¢ã‚’å¹³è¡¡æœ¨ã¨åŒç‰ã®ãƒ‘ãƒ•ã‚©ãƒ¼ãƒžãƒ³ã‚¹ã§å®Ÿè¡Œå¯èƒ½ãªãƒªã‚¹ãƒˆæ§‹é€ ã§ã™ã€‚ Skip Listã¯é€£çµãƒªã‚¹ãƒˆã®å¤šå±¤æ§‹æˆã«ãªã£ã¦ã„ã¾ã™ã€‚è·¯ç·šã«ä¾‹ãˆã‚‹ã¨ã€æœ€ä¸‹å±¤ã®ãƒªãƒ³ã‚¯ã¯å„é§…åœè»Šã®ã‚ˆã†ã«ã€å…¨è¦ç´ ã‚’çµã‚“ã§ã„ã¾ã™ã€‚ä¸€æ–¹ã€ä¸Šå±¤ã®ãƒªãƒ³ã‚¯ã¯æ€¥è¡Œã‚„ç‰¹æ€¥ã®ã‚ˆã†ã«ã€é€”ä¸ã®è¦ç´ ã‚’ã‚¹ã‚ãƒƒãƒ—ã™ã‚‹ã‚ˆã†ã«ãªã£ã¦ã„ã¾ã™ã€‚ã“ã®è·¯ç·šã‚’ç‰¹æ€¥â†’æ€¥è¡Œâ†’â€¦â†’å„é§…ã¨ä¹—ã‚Šç¶™ãã“ã¨ã§ã€ç›®çš„ã®è¦ç´ ã«é«˜é€Ÿã«åˆ°é”ã§ãã‚‹ä»•çµ„ã¿ã§ã™ã€‚ã‚‚ã£ã¨è©³ã—ã„è§£èª¬ã¯ã“ã¡ã‚‰ã‚„ã“ã¡ã‚‰ã«ã‚ã‚Šã¾ã™ã€‚ ã§ã€ã“ã“ã‹ã‚‰ãŒæœ¬é¡Œã§ã™ã€‚Skip Listã®å®Ÿè£…ã¯ã„ãã¤ã‚‚å‡ºã¦ã„ã‚‹ã‚“ã§ã™ãŒã€Sorted Listã¨ã—ã¦ã®å®Ÿè£…ã°ã‹ã‚Šã§ã€è¦ç´ ã‚’ä»»æ„é †åºã§æ ¼ç´ã§ãã¦ãƒ©ãƒ³ãƒ€ãƒ ã‚¢ã‚¯ã‚»ã‚¹ï¼ˆindexã‚’æŒ‡å®šã—ã¦ã®ã‚¢ã‚¯ã‚»ã‚¹ï¼‰å¯èƒ½ãªSkip ListãŒè¦‹ã¤ã‹ã‚‰ãªã‹ã£ãŸã®ã§ã€è‡ªåˆ†ã§ä½œã£ã¦ã¿ã¾ã—ãŸã€‚ é€šå¸¸ã®Skip
quodius 2013/10/29
java

skiplist

algorithm
ãƒªãƒ³ã‚¯
ã‚µãƒ«ã§ã‚‚ã‚ã‹ã‚‹é¡”æ¤œå‡ºã®åŽŸç† - ç§‘å¦ä¿¡ä»°
é¡”æ¤œå‡ºæ©Ÿèƒ½ã¯ã“ã“æ•°å¹´ã§æ€¥æ¿€ã«æ™®åŠã—ã¦ãƒ‡ã‚¸ã‚«ãƒ¡ã¨ã‹ã‚±ãƒ¼ã‚¿ã‚¤ã¨ã‹ã«ãƒ•ãƒ„ãƒ¼ã«å…¥ã‚‹ã‚ˆã†ã«ãªã£ãŸã‚Šã€Googleç”»åƒæ¤œç´¢ã®ã‚ªãƒ—ã‚·ãƒ§ãƒ³ã«å…¥ã£ã¦ãŸã‚Šã—ã¦ã€ã™ã£ã‹ã‚Šã‚³ãƒ¢ãƒ‡ã‚£ãƒ†ã‚£åŒ–ã—ã¡ã‚ƒã£ã¦ã‚‹ã‘ã©ã€ã¡ã‚‡ã£ã¨å‰ã¾ã§ã¯ã™ã”ã„å›°é›£ã§å®Ÿç”¨åŒ–ã«æ‰‹ã‚’å‡ºã™ãªã‚“ã¦ã¨ã¦ã‚‚ã¨ã¦ã‚‚ãªæŠ€è¡“ã ã£ãŸã‚“ã ã‚ˆãã€‚ 2001å¹´ã®Viola & Johnsã®è«–æ–‡*1ã§è¶…é«˜é€Ÿï¼†è¶…æ£ç¢ºãªæ¤œå‡ºã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒç™ºè¡¨ã•ã‚Œã‚‹ã¾ã§ã¯ã€‚ ã“ã‚Œã®ç”»æœŸçš„ã ã£ãŸç‚¹ã¯éžåŠ›ãªãƒ‘ã‚½ã‚³ãƒ³ï¼ˆã¨ã‹ç¾åœ¨ã®ã‚±ãƒ¼ã‚¿ã‚¤å†…è”µCPUã¨ã‹ï¼‰ã§ç”»åƒä¸ã‹ã‚‰ãƒªã‚¢ãƒ«ã‚¿ã‚¤ãƒ ã«é¡”ã‚’æ¤œå‡ºã§ããŸã“ã¨ãªã‚“ã ã€‚ ã‚ãƒ¢ã¯ï¼“ç‚¹ã€‚ Integral-Imageã«ã‚ˆã‚‹Haar-likeæ¤œå‡ºå™¨ã®é«˜é€Ÿæ¼”ç®— AdaBoostã«ã‚ˆã‚‹æ¤œå‡ºèƒ½åŠ›ã®å¼·åŒ– å¤šæ®µãƒ•ã‚£ãƒ«ã‚¿ï¼ˆcascadeï¼‰ã«ã‚ˆã‚‹éžé¡”é ˜åŸŸã®é«˜é€ŸæŽ’é™¤ å…·ä½“çš„ã«ã©ã‚ŒãŒViolaã‚‰ã®ã‚ªãƒªã‚¸ãƒŠãƒ«ã®ä»•äº‹ãªã®ã‹ã¯ã‚ˆãçŸ¥ã‚‰ãªã„ã‘ã‚Œã©ã€‚ å°‘ãªãã¨ã‚‚ä¸€å€‹ç›®ã¨ä¸‰å€‹ç›®ã¯ãã†ãªæ°—ãŒã™ã‚‹ã€‚ Inte
quodius 2010/06/17
ç”»åƒ

ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿

Algorithm
ãƒªãƒ³ã‚¯
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ è¨è¨ˆ è¬›ç¾©è³‡æ–™ 2005
Algorithm Design Course Materials 2013 Oct 7: Introduction and Computational Complexity Oct 15: Search Trees Oct 21: Combinatorial Optimization Oct 28: Heuristic Search Nov 5: Text Search Nov 11: Data Compression Nov 18: Memory Management Nov 25: Graph Algorithms 1/2 Dec 2: Graph Algorithms 2/2 Dec 9: Computational Geometry Dec 16: Concurrency Control Jan 15: Canceled Jan 20: Clustering Course Pro
quodius 2010/02/03
ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°

algorithm

è³‡æ–™
ãƒªãƒ³ã‚¯
æœ€é€Ÿä¸¦ã³æ›¿ãˆç ”ç©¶ä¼š - Yappo::ã‚¿ãƒ¯ã‚·
1000ä¸‡è¡Œã¨ã‹10å„„è¡Œã§ã‚‚ä½•ã§ã‚‚ã„ã„ã‘ã©ã€ã„ã£ã±ã„ãƒ‡ãƒ¼ã‚¿ãŒå…¥ã£ã¦ã‚‹ãƒ†ãƒ¼ãƒ–ãƒ«ã®sortã‚«ãƒ©ãƒ ã®å€¤ã‚’ä¸¦ã³æ›¿ãˆãŸã„ã€‚ ä¾‹ãˆã°ä»¥ä¸‹ã®ã‚ˆã†ã«sort_testãƒ†ãƒ¼ãƒ–ãƒ«ã‚’ä½œã‚‹ use strict; use warnings; use DBI; my $dbi = DBI->connect('DBI:mysql:database=test'); $dbi->do('DROP TABLE IF EXISTS sort_test'); $dbi->do(<<SQL); CREATE TABLE sort_test ( id INT, sort INT, index(id), index(sort) ) ENGINE=InnoDB SQL my $sth = $dbi->prepare('INSERT INTO sort_test VALUES' . join(', ', ('(?,?)')x10_000
quodius 2009/11/09
programming

Algorithm

sql
ãƒªãƒ³ã‚¯
ã‚ªãƒ¼ãƒ€ãƒ¼ã‚’æ¥µã‚ã‚‹æ€è€ƒæ³•
ãƒ—ãƒã‚°ãƒ©ãƒ ã®å®Ÿè¡Œã«æŽ›ã‹ã‚‹æ™‚é–“ã‚’æŠŠæ¡ã—ã¦ãŠãã®ã¯ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’è¡Œã†ä¸Šã§åŸºæœ¬çš„ãªæ³¨æ„ç‚¹ã§ã™ã€‚ä»Šå›žã¯ã€è¨ˆç®—é‡ã®ã‚ªãƒ¼ãƒ€ãƒ¼ã«ã¤ã„ã¦å¦ã³ãªãŒã‚‰ã€TopCoderã®Mediumå•é¡Œã‚’è€ƒãˆã¦ã¿ã¾ã—ã‚‡ã†ã€‚ ãƒ—ãƒã‚°ãƒ©ãƒ ã®å®Ÿè¡Œæ™‚é–“ æ¥å‹™ã¨ã—ã¦ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’ã•ã‚Œã¦ã„ã‚‹æ–¹ã«ã¯é‡ˆè¿¦ã«èª¬æ³•ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ãŒã€ãƒ—ãƒã‚°ãƒ©ãƒ ã®å®Ÿè¡Œã«æŽ›ã‹ã‚‹æ™‚é–“ã‚’æŠŠæ¡ã—ã¦ãŠãã®ã¯ã€ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’è¡Œã†ä¸Šã§åŸºæœ¬çš„ãªæ³¨æ„ç‚¹ã§ã™ã€‚ãã—ã¦ã“ã‚Œã¯ã€TopCoderãªã©ã®ã‚³ãƒ³ãƒ†ã‚¹ãƒˆã§ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’çµ„ã‚€éš›ã«ã‚‚ã‚ˆãå½“ã¦ã¯ã¾ã‚Šã¾ã™ã€‚é€šå¸¸ã€ã“ã†ã—ãŸã“ã¨ã¯æ„Ÿè¦šçš„ã«ç†è§£ã—ã¦ã„ã‚‹æ–¹ãŒã»ã¨ã‚“ã©ã ã¨æ€ã„ã¾ã™ãŒã€å…·ä½“çš„ã«ã©ã‚Œãã‚‰ã„ã®ãƒ«ãƒ¼ãƒ—ã‚’å›žã™ã¨ä½•ç§’æŽ›ã‹ã‚‹ã€ã¨ã„ã£ãŸåŸºæº–ã‚’æŒã£ã¦ã„ã‚‹äººã¯å°‘ãªã„ã®ã§ã¯ãªã„ã§ã—ã‚‡ã†ã‹ï¼Ÿã€€éžå¸¸ã«åŸºæœ¬çš„ãªã“ã¨ã§ã™ãŒã€ãƒ—ãƒã‚°ãƒ©ãƒ ã®å®Ÿè¡Œæ™‚é–“ã«é–¢ã—ã¦å†ç¢ºèªã—ã¦ãŠããŸã„ã¨æ€ã„ã¾ã™ã€‚ TopCoderã®åˆ¶é™ã«é–¢ã—ã¦ TopCoderã§ã¯ã€å®Ÿè¡Œæ™‚é–“ãŠã‚ˆã³ãƒ¡ãƒ¢ãƒªä½¿
quodius 2009/10/27
algorithm

ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°
ãƒªãƒ³ã‚¯
404 Blog Not Found:ãƒ—ãƒã‚°ãƒ©ãƒžãƒ¼ã§ãªãã¦ã‚‚åå‰ãã‚‰ã„è¦šãˆã¦ãŠããŸã„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ x10
2007å¹´11æœˆ26æ—¥18:15 ã‚«ãƒ†ã‚´ãƒªMathLightweight Languages ãƒ—ãƒã‚°ãƒ©ãƒžãƒ¼ã§ãªãã¦ã‚‚åå‰ãã‚‰ã„è¦šãˆã¦ãŠããŸã„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ x10 ãŽãã£ ã‚ãªãŸãŒä¸€ç•ªå¥½ããªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’æ•™ãˆã¦ãã ã•ã„ã€‚ ã¾ãŸã€ãã®ç†ç”±ã‚„ã©ã‚“ãªç‚¹ãŒå¥½ããªã®ã‹ã‚‚æ•™ãˆã¦ãã ã•ã„ã€‚ - äººåŠ›æ¤œç´¢ã¯ã¦ãª ãªãœãŽãã£ã¦ã—ã¦ã„ã‚‹ã‹ã¨ã„ã†ã¨ã€å®Ÿã¯ã™ã§ã«ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ æœ¬ã®ç™ºæ³¨ã‚’å—ã‘ã¦ã„ã‚‹ã‹ã‚‰ãªã®ã ã€‚ã„ã¤ã¾ã§ã‚‚ä¼ã›ã¦ãŠãã®ã‚‚ãªã‚“ãªã®ã§ã€ã“ã“ã«ãˆã„ã‚„ã£ã¨discloseã—ã¦ã—ã¾ã†ã“ã¨ã«ã™ã‚‹ã€‚ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å¤§å‹Ÿé›†!ã€€C&Rç ”ç©¶æ‰€ - ãƒˆãƒƒãƒ—ãƒšãƒ¼ã‚¸ ãã®ä¸‹æ›¸ãã‚‚ã‹ãã¦ã€ãã“ã§ã‚‚ç´¹ä»‹ã—ãªã„ã‚ã‘ã«è¡Œã‹ãªã„ãƒ¡ã‚¸ãƒ£ãƒ¼ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ã¨ã‚Šã‚ãˆãš10å€‹ç´¹ä»‹ã—ã¦ãŠãã“ã¨ã«ã™ã‚‹ã€‚ ãƒ¦ãƒ¼ã‚¯ãƒªãƒƒãƒ‰ã®äº’é™¤æ³•(Euclidean algorithm) ãã®æ˜”(æ•°ç™¾å¹´ã»ã©å‰)ã¯ã€Œã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€ã¨ã„ãˆã°ã€ã€Œæ‰‹é †ä¸€èˆ¬ã€ã‚’æŒ‡ã™ã®ã§ã¯ãªãã€ã“ã®ã€Œäº’é™¤æ³•
quodius 2008/02/28
algorithm

dankogai

programming

ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°
ãƒªãƒ³ã‚¯
1