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

nirvash id:nirvash

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

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

Belipse.wxp
nirvash 2008/08/06
[system:filetype:pdf][system:media:document]æ¥•å††ã®bresenham algorithm æç”»

graphics

algorithm
ãƒªãƒ³ã‚¯
DO++: æ©Ÿæ¢°å¦ç¿’ã«ã‚ˆã‚‹è‡ªç„¶è¨€èªžå‡¦ç†ãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«
è‡ªç„¶è¨€èªžå‡¦ç†ã®ã¨ãã«ä½¿ã†æ©Ÿæ¢°å¦ç¿’æ‰‹æ³•ã®ãƒ†ã‚¯ãƒ‹ãƒƒã‚¯ã‚’ã–ãƒ¼ã£ã¨ï¼’æ™‚é–“ç¨‹åº¦ã§ç´¹ä»‹ã—ã¦ã»ã—ã„ã¨ã®ã“ã¨ã ã£ãŸã®ã§ä»Šæ—¥è©±ã—ã¦ãã¾ã—ãŸã€‚åŸºæœ¬çš„ã«ã€ãã‚“ãªã«é ‘å¼µã‚‰ãªãã¦ã‚‚åŠ¹æžœãŒå¤§ãã„ã‚‚ã®ã‚’ä¸å¿ƒã«èª¬æ˜Žï¼ˆç‰¹ã«ãƒ‘ãƒ¼ã‚»ãƒ—ãƒˆãƒãƒ³ã¨ã‹ï¼‰ã‚’èª¬æ˜Žã—ã¦ã¾ã™ã€‚ ç´¹ä»‹ã—ãŸæ‰‹æ³•ã¯ãƒ‘ãƒ¼ã‚»ãƒ—ãƒˆãƒãƒ³ã€æœ€å¤§ã‚¨ãƒ³ãƒˆãƒãƒ”ãƒ¼ã€æ£å‰‡åŒ–ã€å¤šã‚¯ãƒ©ã‚¹åˆ†é¡žã€ç³»åˆ—åˆ†é¡žï¼ˆCRF, Structured Perceptronï¼‰ãªã©ãªã©ã§ã™ã€‚ã©ã‚Œã‚‚ä¸€ã‹ã˜ã‚Šã™ã‚‹æ„Ÿã˜ã§ç¶²ç¾…çš„ã«è¦‹ã‚‹æ–¹ã‚’å„ªå…ˆã—ã¦ã¾ã™ã€‚å€‹ã€…ã®è©³ã—ã„è©±ã¯ãã‚Œãžã‚Œã®æ–‡çŒ®ã‚„å®Ÿè£…ãªã©ã‚’å½“ãŸã£ã¦ã¿ã¦ãã ã•ã„ã€‚ ã‚¹ãƒ©ã‚¤ãƒ‰ [ppt] [pdf] ã“ã“ã§è©±ã—ã¦ã„ã‚‹ã®ã¯ç·šå½¢è˜åˆ¥ãƒ¢ãƒ‡ãƒ«ã®æ•™å¸«æœ‰ã‚Šå¦ç¿’ãŒä¸å¿ƒã§æ•™å¸«ç„¡ã—å¦ç¿’ï¼ˆã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ãªã©ï¼‰ãªã©ä»–ã®è‡ªç„¶è¨€èªžå‡¦ç†ã‚’æ”¯ãˆã‚‹æŠ€è¡“ã¯çœã„ã¦ã¾ã™ã€‚ ã“ã†ã„ã†ã®ã‚’ä½¿ã£ã¦ï¼ˆä½¿ã‚ãªãã¦ã‚‚ã„ã„ã‘ã©ï¼‰ã©ã‚“ã©ã‚“ã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³ä½œã‚‰ãªã„ã¨ã„ã‹ã‚“ãã€‚ Tarot is not used to ma
nirvash 2008/08/04
tutorial

algorithm

machinelearning

è‡ªç„¶è¨€èªžå‡¦ç†
ãƒªãƒ³ã‚¯
GC - GCã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ è©³ç´°è§£èª¬ - livedoor Wikiï¼ˆã‚¦ã‚£ã‚ï¼‰
GCã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ è©³ç´°è§£èª¬ æ—¥æœ¬èªžã®è³‡æ–™ãŒã™ããªã„GCã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦è©³ç´°ã«è§£èª¬ã—ã¾ã™ ãƒˆãƒƒãƒ—ãƒšãƒ¼ã‚¸ãƒšãƒ¼ã‚¸ä¸€è¦§ãƒ¡ãƒ³ãƒãƒ¼ç·¨é›† GC æœ€çµ‚æ›´æ–°ï¼š author_nariÂ 2010å¹´03æœˆ14æ—¥(æ—¥) 20:47:11å±¥æ´ Tweet ã“ã®WikiãŒç›®æŒ‡ã™æ‰€ GCã¨ã¯ï¼Ÿ GCã‚’å¦ã¶å‰ã«çŸ¥ã£ã¦ãŠãäº‹ å®Ÿè¡Œæ™‚ãƒ¡ãƒ¢ãƒªæ§‹é€ åŸºæœ¬ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ç·¨ Reference Counter Mark&Sweep Copying å¿œç”¨ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ç·¨ IncrementalGC ä¸–ä»£åˆ¥GC ã‚¹ãƒŠãƒƒãƒ—ã‚·ãƒ§ãƒƒãƒˆåž‹GC LazySweep TwoFinger Lisp2 Partial Mark and Sweep -Cycle Collection- Mostly Parallel GC train gc MostlyCopyingGC(Bartlett 1989) TreadmillGC(Barker 1992) è£œè¶³
nirvash 2008/01/17
algorithm

gc
ãƒªãƒ³ã‚¯
Index of /pub/essay/hagiya/cp
Name Last modified Size Description Parent Directory 16-Apr-1994 19:46 - 1 12-Jul-1993 12:47 17k 2 12-Jul-1993 12:47 17k 3 12-Jul-1993 12:47 16k 4 12-Jul-1993 12:47 12k 5 12-Jul-1993 12:47 16k 6 12-Jul-1993 12:47 17k mokuji 12-Jul-1993 12:47 1k
nirvash 2007/12/14
algorithm
ãƒªãƒ³ã‚¯
How Regexes Work
Mark-Jason Dominus Copyright Â© 1998 The Perl Journal. Reprinted with permission. This isn't an article about how to use regexes; you've probably seen plenty of those already. It's about how you would write a regex package from scratch, in a language like C that doesn't already have regexes. I'll demonstrate a new module, Regex.pm, which implements regexes from nothing, in Perl. This will give you
nirvash 2007/12/03
algorithm

perl

programming

regex
ãƒªãƒ³ã‚¯
ãƒšã‚°ã‚½ãƒªãƒ†ã‚£ã‚¢ã‚’è§£ã
ã“ã‚Œã¯è«–æ–‡ã®ã‚ã‚‰ã™ã˜ã§ã™. å…¨æ–‡ã‚’èªã¿ãŸã„æ–¹ã¯ ã“ã¡ã‚‰ã‚’ã©ã†ãž. æœ¬è«–æ–‡ã®ç›®çš„ ãƒšã‚°ã‚½ãƒªãƒ†ã‚£ã‚¢ã¯å¤å…¸çš„ãªãƒ‘ã‚ºãƒ«ã§ã‚ã‚‹. ãƒšã‚°ã‚½ãƒªãƒ†ã‚£ã‚¢ã‚’ä¸€èˆ¬åŒ–ã—ãŸå•é¡Œã« è§£ãŒå˜åœ¨ã™ã‚‹ã‹ã©ã†ã‹ã®åˆ¤å®šã¯NPå®Œå…¨å•é¡Œã§ã‚ã‚Š, ã“ã‚Œã‚’åˆ¤å®šã™ã‚‹ã®ã¯éžå¸¸ã« é›£ã—ã„. æœ¬è«–æ–‡ã§ã¯ãƒšã‚°ã‚½ãƒªãƒ†ã‚£ã‚¢ã«ã¤ã„ã¦ã®ç†è«–, è¨ˆç®—æ©Ÿã«ã‚ˆã‚‹è§£ã®å˜åœ¨ã® åˆ¤å®šãŠã‚ˆã³è§£ã®æ‰‹é †ã‚’æ±‚ã‚ã‚‹ç®—æ³•ã«ã¤ã„ã¦ç ”ç©¶ã™ã‚‹. æœ¬è«–æ–‡ã®æ¦‚è¦ ç¬¬2ç« ã§ãƒšã‚°ã‚½ãƒªãƒ†ã‚£ã‚¢ã¨ã„ã†ãƒ‘ã‚ºãƒ«ã‚’ç´¹ä»‹ã™ã‚‹. ç¬¬3ç« ã§ã¯æ—¢å˜ã®ç ”ç©¶, ã¨ã ã«Berlekamp, Conway, Guyã«ã‚ˆã£ã¦ææ¡ˆã•ã‚ŒãŸãƒ‘ã‚´ãƒ€é–¢æ•°ã®ç†è«–ã‚„ãã®å‘¨è¾ºã« ã¤ã„ã¦èª¬æ˜Žã™ã‚‹. ç¬¬3ç« ã®çµæžœã®å¤šãã¯ è…é‡Žã«ã‚ˆã‚‹è«–æ–‡ã§å¾—ã‚‰ã‚ŒãŸã‚‚ã®ã§ã‚ã‚Š, ç·šå½¢è¨ˆç”»å•é¡ŒãŒå¤§ããªæŸ±ã¨ãªã£ã¦ ã„ã‚‹. ç¬¬4ç« ã§ã¯ç¬¬3ç« ã§è¿°ã¹ã‚‰ã‚Œã‚‹ã‚¸ãƒ£ãƒ³ãƒ—å›žæ•°ã®æŽ¨å®šã«ã¤ã„ã¦, ã‚ˆã‚ŠåŠ¹çŽ‡çš„ ã§ç²¾åº¦ã®ã‚ˆã„æŽ¨å®šã®æ–¹æ³•ã‚’ææ¡ˆã™ã‚‹. ã¾
nirvash 2007/12/02
algorithm

game
ãƒªãƒ³ã‚¯
ã‚ãªãŸãŒä¸€ç•ªå¥½ããªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’æ•™ãˆã¦ãã ã•ã„ã€‚ ã¾ãŸã€ãã®ç†ç”±ã‚„ã©ã‚“ãªç‚¹ãŒå¥½ããªã®ã‹ã‚‚æ•™ãˆã¦ãã ã•ã„ã€‚ - äººåŠ›æ¤œç´¢ã¯ã¦ãª
ã‚ãªãŸãŒä¸€ç•ªå¥½ããªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’æ•™ãˆã¦ãã ã•ã„ã€‚ ã¾ãŸã€ãã®ç†ç”±ã‚„ã©ã‚“ãªç‚¹ãŒå¥½ããªã®ã‹ã‚‚æ•™ãˆã¦ãã ã•ã„ã€‚
nirvash 2007/11/26
ãƒ€ãƒ³ã‚³ãƒ»ã‚¬ã‚¤åŠ¹æžœã§ã‚‚ã†å°‘ã—ä¼¸ã³ã‚‹ã‹ã‚‚ã—ã‚Œãªã„ã®ã§ã€å¾Œã§èªã‚€ç”¨ã€‚

algorithm

programming
ãƒªãƒ³ã‚¯
Syntax Error(2004-02)
_ Suffix Array ã®å®Ÿè£…ã‚’ã—ã¦ã¿ã‚‹ã€‚(Suffix Array ã®èª¬æ˜ŽãŒå‚è€ƒã«ãªã‚‹ã€‚)openã¨ã‹closeã¨ã‹mmapã¨ã‹ã“ã‚“ãªä½Žãƒ¬ãƒ™ãƒ«ã®ã‚‚ã®ã‚’ä½¿ã£ãŸã®ã¯åˆã‚ã¦ãªã®ã§ã€å°‘ã—æ‰‹é–“ã©ã‚‹ã€‚ãªãœæ—¢å˜ã®ã‚‚ã®ã‚’ä½¿ã‚ãªã„ã®ã‹ã¨è¨€ãˆã°ã€ã‚ã¨ã¯ã“ã‚Œã‚’è‹±è¾žéƒŽãƒ“ãƒ¥ãƒ¼ã‚¢ã«çµ„ã¿è¾¼ã‚‚ã†ã¨æ€ã£ãŸã‹ã‚‰ã€‚(ã©ã†ã‚‚ä»Šã®ãƒãƒ¼ã‚¸ãƒ§ãƒ³ã¯å˜ãªã‚‹ã‚¤ãƒ³ã‚¯ãƒªãƒ¡ãƒ³ã‚¿ãƒ«ã‚µãƒ¼ãƒã®ã‚ˆã†ã§ã‚ã‚‹ã€‚)ã‚ã¨ã‚„ã£ã¦ã¿ãŸã‹ã£ãŸã£ã¦ã®ã‚‚ã€‚ã†ã¾ãå‡ºããŸæšã«ã¯æ²¼ç”°ã•ã‚“ã«ãƒ•ã‚£ãƒ¼ãƒ‰ãƒãƒƒã‚¯ã—ã‚ˆã†ã€‚ ãŸã ã€ã‹ãªã‚Šå˜ç´”ãªå®Ÿè£…ãªã®ã§ã„ã‚ã„ã‚æ€§èƒ½ä¸Šã®å•é¡Œã‚‚ã€‚(ä¸€å¿œèªè˜ã¯ã—ã¦ã¾ã™ã‚ˆã¨ã„ã†ã“ã¨ã§æ›¸ã„ã¦ãŠãã€‚)ã¾ãšã€quick sortãŒã‚ã»ã€‚å·¦å³ã‹ã‚‰æŒŸã¿è¾¼ã‚€ã‚ˆã†ã«è»¸è¦ç´ ã¨ã®å¤§å°ã‚’æ¯”ã¹ã‚Œã°ã€swapå›žæ•°ãŒæ¸›ã‚‹ã€‚ãã‚‚ãã‚‚quick sortã‚ˆã‚Šã€å…ˆé 1-2æ–‡å—ã®bin sortã‚’ä½¿ãˆã°ã„ã„ã‚ˆã†ãªã€‚ ã‚‚ã†ä¸€ç‚¹ã¯æ–‡å—ã‚³ãƒ¼ãƒ‰ã‚’åˆ©ç”¨ã—ãŸindexã®å‰Šæ¸›ã€‚æ®†ã©ãŒæ—¥æœ¬èªžãªã‚‰ã€å¿…è¦ãªãƒ‡
nirvash 2007/11/26
å®Ÿè£…ã™ã‚‹ã‹ã©ã†ã‹ã®å‚è€ƒã€‚æŠ€è¡“çš„ã«ã‚„ã‚ŠãŸã„ãªãã¨æ€ã£ãŸã‚‰ã€ã‹ãªã€‚

algorithm

java

suffixarray
ãƒªãƒ³ã‚¯
4TopCoder;å¤·è—¤ã•ã‚“ã®TopCoderå•é¡Œã‚’ã¨ã‚Šã‚ã’ãŸãƒ–ãƒã‚°
Love solving probl ems? Here's your chance to prove it.
nirvash 2007/11/26
TopCoder ã®æˆç¸¾è‰¯ã„äººã¯ã™ã”ã„ãªã€‚çµæ§‹ç¶šã‘ã‚‹ã®å¤§å¤‰ã€‚ãŸãã•ã‚“ snippet ç”¨æ„ã—ã¦ã€ã„ã‹ã«ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®çµ„ã¿åˆã‚ã›ã‚’è¦‹ã¤ã‘ã¦é«˜é€Ÿã«æ§‹ç¯‰ã™ã‚‹ã‹ã€‚è§£æ³•ãŒåˆ†ã‹ã‚‰ã‚“ã“ã¨ãŒå¤šã„ã‚“ã ã‘ã©ãã€‚

TopCoder

algorithm

programming
ãƒªãƒ³ã‚¯
404 Not Found | ç†åŒ–å¦ç ”ç©¶æ‰€
ãŠæŽ¢ã—ã®ãƒšãƒ¼ã‚¸ãŒè¦‹ã¤ã‹ã‚Šã¾ã›ã‚“ã§ã—ãŸã€‚ èª ã«æã‚Œå…¥ã‚Šã¾ã™ãŒã€ãŠå®¢æ§˜ãŒã‚¢ã‚¯ã‚»ã‚¹ã—ã‚ˆã†ã¨ã—ãŸãƒšãƒ¼ã‚¸ã¾ãŸã¯ãƒ•ã‚¡ã‚¤ãƒ«ãŒè¦‹ã¤ã‹ã‚Šã¾ã›ã‚“ã§ã—ãŸã€‚ ãŠæŽ¢ã—ã®ãƒšãƒ¼ã‚¸ã¯ã€å‰Šé™¤ã¾ãŸã¯åå‰ãŒå¤‰æ›´ã•ã‚ŒãŸã€ã‚‚ã—ãã¯ä¸€æ™‚çš„ã«ä½¿ç”¨ã§ããªããªã£ã¦ã„ã‚‹å¯èƒ½æ€§ãŒã”ã–ã„ã¾ã™ã€‚
nirvash 2007/11/26
åŽŸå½¢è³ªã®æŒã¤ç‰©ç†åŒ–å¦çš„ãªæ€§è³ªï¼ˆä¾‹ãˆã°ãƒªã‚ºãƒ ã‚„ãƒ‘ã‚¿ãƒ¼ãƒ³å½¢æˆï¼‰ãŒå·§ã¿ã«çµ„ã¿åˆã†ã“ã¨ã«ã‚ˆã£ã¦ã€è¿·è·¯ã‚’æœ€çŸãƒ«ãƒ¼ãƒˆã§è§£ãã€‚ãƒã‚ºãƒŸã¯ã‚‚ã†æ™‚ä»£é…ã‚Œã ã£ãŸã®ã‹ã€‚

algorithm

life
ãƒªãƒ³ã‚¯
æ–‡æ›¸æ¯”è¼ƒï¼ˆ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
nirvash 2007/11/26
algorithm

diff

reference

text
ãƒªãƒ³ã‚¯
SQLã§æœ¨ã¨éšŽå±¤æ§‹é€ ã®ãƒ‡ãƒ¼ã‚¿ã‚’æ‰±ã†â€•â€•å…¥ã‚Œåé›†åˆãƒ¢ãƒ‡ãƒ«
ã‚µãƒ¼ãƒ“ã‚¹çµ‚äº†ã®ãŠçŸ¥ã‚‰ã› ã„ã¤ã‚‚Yahoo! JAPANã®ã‚µãƒ¼ãƒ“ã‚¹ã‚’ã”åˆ©ç”¨ã„ãŸã ãèª ã«ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã™ã€‚ ãŠå®¢æ§˜ãŒã‚¢ã‚¯ã‚»ã‚¹ã•ã‚ŒãŸã‚µãƒ¼ãƒ“ã‚¹ã¯æœ¬æ—¥ã¾ã§ã«ã‚µãƒ¼ãƒ“ã‚¹ã‚’çµ‚äº†ã„ãŸã—ã¾ã—ãŸã€‚ ä»Šå¾Œã¨ã‚‚Yahoo! JAPANã®ã‚µãƒ¼ãƒ“ã‚¹ã‚’ã”æ„›é¡§ãã ã•ã„ã¾ã™ã‚ˆã†ã€ã‚ˆã‚ã—ããŠé¡˜ã„ã„ãŸã—ã¾ã™ã€‚
nirvash 2007/11/26
Tree

algorithm

database

sql

tips
ãƒªãƒ³ã‚¯
suffix array
æ›´æ–°å±¥æ´ 2004/01/07 ã€€O(N) æ§‹ç¯‰ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ä¸‰ç¨®è¿½åŠ ï¼ˆKo &Alulu, Kim & al., Karkkainen & Sanders) Suffix Arrayã¯ã€æœ€è¿‘æ³¨ç›®ã‚’é›†ã‚ã¦ã„ã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã™ã€‚ãã®ç†ç”±ã¨ã—ã¦ã€ (1)å¤§è¦æ¨¡ãªãƒ‡ãƒ¼ã‚¿ã«å¯¾ã—ã¦ã€é«˜é€Ÿã«æ¤œç´¢ã€æƒ…å ±æŠ½å‡ºã‚’è¡Œã†ã“ã¨ãŒã§ãã‚‹ (2)BWTã¨ã—ã¦ãƒ‡ãƒ¼ã‚¿åœ§ç¸®ã«ç”¨ã„ã‚‹ã“ã¨ãŒã§ãã‚‹ã€‚ ã“ã¨ãŒæŒ™ã’ã‚‰ã‚Œã¾ã™ã€‚(1)ã«é–¢ã—ã¦ã¯è‡ªç„¶è¨€èªžå‡¦ç†ã«ãŠã„ã¦ã€è†¨å¤§ãªé‡ã®ã‚³ãƒ¼ãƒ‘ã‚¹ã‹ã‚‰æƒ…å ±ï¼ˆä¾‹ãˆã°ã€å˜èªžã®å‡ºç¾å›žæ•°ãªã©ï¼‰ã‚’èª¿ã¹ã‚‹ã¨ãã«ã«Suffix Arrayã‚’ç”¨ã„ã‚‹ã¨éžå¸¸ã«é«˜é€Ÿã«æ±‚ã‚ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚ è†¨å¤§ãªé‡ã®ã‚³ãƒ¼ãƒ‘ã‚¹ã«åŸºã¥ã„ãŸè‡ªç„¶è¨€èªžå‡¦ç†ãŒç››ã‚“ã«ãªã£ã¦ãã¦ã„ã‚‹ä»Šã€Suffix ArrayãŒæ³¨ç›®ã‚’é›†ã‚ã¦ã„ã¾ã™ã€‚ ã¾ãŸã€ã‚²ãƒŽãƒ æƒ…å ±ã‚’èª¿ã¹ã‚‹ãƒã‚¤ã‚ªã‚¤ãƒ³ãƒ•ã‚©ãƒžãƒ†ã‚£ã‚¯ã‚¹ã«ãŠã„ã¦ã‚‚ã€ã“ã“ã®é…åˆ—ã¨ä¼¼ã¦ã„ã‚‹éƒ¨åˆ†ï¼ˆä¾‹ãˆã°CCAGï¼‰ã‚’èª¿ã¹ã‚‹ã¨ã„ã£ãŸå ´åˆ
nirvash 2007/11/26
java ã§çµ„ã‚“ã ã‚‰é…ã„ã‚ˆãªã

algorithm

reference

search
ãƒªãƒ³ã‚¯
Libicpc - nya3.jp
libic pc ãƒãƒ¼ãƒ kkntkr / Unknown ã«ã‚ˆã‚‹ã€ACM-ICPC å‘ã‘ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®å®Ÿè£…ã‚’ã¾ã¨ã‚ãŸãƒšãƒ¼ã‚¸ã§ã™ã€‚ åŸºç¤Ž ãƒ†ãƒ³ãƒ—ãƒ¬ãƒ¼ãƒˆ ãƒžã‚¯ãƒ è¨ˆç®— ãƒ“ãƒƒãƒˆæ¼”ç®— å®Ÿæ•°æ¯”è¼ƒ å¹¾ä½• åŸºç¤Ž ãƒ‡ãƒ¼ã‚¿æ§‹é€ å†…ç©ãƒ»å¤–ç© å›žè»¢æ–¹å‘é–¢æ•° å°„å½± é¢ç©ãƒ»ä½“ç© å††ã¨å††ã®å…±é€šéƒ¨åˆ† å¤šè§’å½¢ã®é¢ç© äº¤å·® å††ã¨å††ã®äº¤ç‚¹ å††ã¨ç›´ç·šã®äº¤å·®åˆ¤å®š å††ã¨ç›´ç·šã®äº¤ç‚¹ å‡¸å¤šè§’å½¢ã¨ç·šåˆ†ã®åŒ…å«åˆ¤å®š å¤šè§’å½¢ã¨ç‚¹ã®åŒ…å«åˆ¤å®š ç›´ç·šã¨ç›´ç·šã®äº¤å·®åˆ¤å®š ç›´ç·šã¨ç›´ç·šã®äº¤ç‚¹ ç›´ç·šã¨ç·šåˆ†ã®äº¤å·®åˆ¤å®š ç·šåˆ†ã¨ç‚¹ã®äº¤å·®åˆ¤å®š ç·šåˆ†ã¨ç·šåˆ†ã®äº¤å·®åˆ¤å®š è·é›¢ æœ€é ç‚¹å¯¾ ç›´ç·šã¨ç‚¹ã®è·é›¢ ç›´ç·šã¨ç›´ç·šã®è·é›¢ ç›´ç·šã¨ç·šåˆ†ã®è·é›¢ ç·šåˆ†ã¨ç‚¹ã®è·é›¢ ç·šåˆ†ã¨ç·šåˆ†ã®è·é›¢ å¤šè§’å½¢ å‡¸åŒ… å‡¸å¤šè§’å½¢ã®ã‚¯ãƒªãƒƒãƒ”ãƒ³ã‚° ãã®ä»– ã‚¢ãƒ¬ãƒ³ã‚¸ãƒ¡ãƒ³ãƒˆ ãƒ€ã‚¤ã‚¹ ä¸‰æ¬¡å…ƒå¹¾ä½• ç›´ç·šã¨ç›´ç·šã®è·é›¢ ã‚°ãƒ©ãƒ• åŸºç¤Ž ãƒ‡ãƒ¼ã‚¿æ§‹é€ æœ€çŸè·¯ Bellman-Ford Dijkstra Warshall-Flo
nirvash 2007/11/15
ACM-ICPCå‘ã‘ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®å®Ÿè£…

algorithm

programming
ãƒªãƒ³ã‚¯
ãƒ¯ãƒ³ã®ã‚¿ã‚¤ãƒ«
ãƒ¯ãƒ³ã®ã‚¿ã‚¤ãƒ«ã«é–¢ã™ã‚‹æ±ºå®šå•é¡Œã«ã¤ã„ã¦ã®èª¬æ˜Ž (èª¬æ˜Žä¸è¶³)ã€‚ ãƒ¯ãƒ³ã®ã‚¿ã‚¤ãƒ«ã¨ã„ã†ã®ã¯4è¾ºãã‚Œãžã‚Œã«æ–‡å—åˆ—(è¨˜å·åˆ—)ãŒæ›¸ã„ã¦ã‚ã‚‹å››è§’ã„ã‚¿ã‚¤ãƒ«ã§ã€ ã‚¿ã‚¤ãƒ«ã‚’ä¸¦ã¹ã‚‹æ™‚ã®è¦å‰‡ãŒã‚ã£ã¦ã€ æŽ¥ã—ã¦ã„ã‚‹2è¾ºã«æ›¸ã‹ã‚Œã¦ã„ã‚‹æ–‡å—åˆ—ã¯åŒã˜ã§ãªã„ã¨ã„ã‘ãªã„ã€‚ ã¾ãŸã‚¿ã‚¤ãƒ«ã‚’å›žè»¢ã•ã›ã¦ã¯ã„ã‘ãªã„ (ã‚‚ã¨ã‚‚ã¨ã®ãƒ¯ãƒ³ã®ã‚¿ã‚¤ãƒ«ã¯å„è¾ºã«è¨˜å·ãŒæ›¸ã‹ã‚ŒãŸã‚¿ã‚¤ãƒ«ã§ã¯ãªã å„è¾ºãŒè‰²ã¥ã‘ãŒã•ã‚ŒãŸã‚¿ã‚¤ãƒ«ã§æŽ¥ã™ã‚‹è¾ºã¯åŒè‰²ã¨ã„ã†è¦å‰‡ã¿ãŸã„ã ã‘ã©ã€ èª¬æ˜Žã®éƒ½åˆã§å¤‰æ›´ã—ãŸ)ã€‚ ãã—ã¦ã€ ä¸Žãˆã‚‰ã‚ŒãŸã‚¿ã‚¤ãƒ«ã®ãƒªã‚¹ãƒˆã«å¯¾ã—ã¦ ãã‚Œã‚‰ã®ã‚¿ã‚¤ãƒ«ã ã‘ã‚’ä½¿ã£ã¦å…¨å¹³é¢ã‚’ã‚¿ã‚¤ãƒ«å¼µã‚Šã§ãã‚‹ã‹ã‚’åˆ¤å®šã›ã‚ˆã€ ã¨ã„ã†ã®ãŒå•é¡Œã€‚ ãŸã ã—ä¸Žãˆã‚‰ã‚ŒãŸã‚¿ã‚¤ãƒ«ã‚’å…¨éƒ¨ä½¿ã†å¿…è¦ã¯åˆ¥ã«ç„¡ã„ã€‚ ä¾‹ãˆã°ã€æ¬¡ã®ã‚ˆã†ãªã‚¿ã‚¤ãƒ«ã‚’ä¸Žãˆã‚‰ã‚ŒãŸã¨ã™ã‚‹ã€‚ ã“ã‚Œã‚‰ã‚¿ã‚¤ãƒ«ã®å ´åˆã€ æ¬¡ã®ã‚ˆã†ãªä¸¦ã³ã‚’ç¹°ã‚Šè¿”ã—ã¦ã„ãã“ã¨ã§å…¨å¹³é¢ã‚’ã‚¿ã‚¤ãƒ«å¼µã‚Šã§ãã‚‹ã€‚ ãƒ¯ãƒ³ã¯åˆã‚å…¨é¢æ•·ãè©°ã‚å¯èƒ½ã‹ã©ã†ã‹ã¯åˆ¤å®šå¯èƒ½ã ã¨è€ƒãˆãŸã¿ãŸã„ã ã‘
nirvash 2007/07/10
algorithm

math
ãƒªãƒ³ã‚¯
Tile-Based Methods in Computer Graphics
nirvash 2007/07/10
algorithm

cg

graphics

paper
ãƒªãƒ³ã‚¯
Subversionã®Diffã‚’C++ã«ç§»æ¤
ä½•ã§ã™ã‹ã“ã‚Œã¯ï¼Ÿ äºŒã¤ã®ã‚·ãƒ¼ã‚±ãƒ³ã‚¹ã®Longest Common Subsequence, Longest Common Subsequence DistanceåŠã³Shortest Edit Scriptã‚’æ±‚ã‚ã‚‹ã‚¯ãƒ©ã‚¹ã€‚ Subversionã®ã‚³ãƒ¼ãƒ‰ã‚’ã€C++ã«ç§»æ¤ã—ãŸã‚‚ã®ã§ã™ã€‚ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ã€"An O(NP) Sequence Comparison Algorithm" (Sun Wu et al.)ã«è¿°ã¹ã‚‰ã‚Œã¦ã„ã‚‹ã‚‚ã®ã¨åŒä¸€ã§ã€è¨ˆç®—é‡ã¯æœ€æ‚ªã§O(NP)ã€å¹³å‡çš„ã«ã¯O(N+PD)ã§ã™ã€‚ãŸã ã—ã€N=äºŒã¤ã®ã‚·ãƒ¼ã‚±ãƒ³ã‚¹ã®é•·ã•ã®å’Œã€P=D/2-Î”/2ã€D=LCSè·é›¢ã€Î”=äºŒã¤ã®ã‚·ãƒ¼ã‚±ãƒ³ã‚¹ã®é•·ã•ã®å·®ã§ã™ã€‚ ã“ã“ã§ã„ã†LCSè·é›¢(longest common subsequence distance)ã¯ã€ã‚ã‚‹ã‚·ãƒ¼ã‚±ãƒ³ã‚¹ã‚’åˆ¥ã®ã‚·ãƒ¼ã‚±ãƒ³ã‚¹ã«å¤‰åŒ–ã•ã›ã‚‹ãŸã‚ã«å¿…è¦ãªã€ã‚·ãƒ³ãƒœãƒ«ã®æŒ¿å…¥åŠã³å‰Šé™¤æ“ä½œã®æœ€å°
nirvash 2007/07/10
algorithm

cpp

diff

subversion
ãƒªãƒ³ã‚¯
Karetta|[ãŠé¡Œ] ã‚µãƒ³ã‚¿ã‚¯ãƒãƒ¼ã‚¹å•é¡Œ
ã‚ªãƒªã‚¸ãƒŠãƒ«ã¯ A new exercise in concurrency å•é¡Œã¯ã“ã‚“ãªæ„Ÿã˜ï¼Ž ãã¼ã™ã‘ã‚µãƒ³ã‚¿ãŒã„ã‚‹ï¼Žä¼‘æ—¥ãŒé–‹ã‘ã¦ï¼Œï¼™é ã„ã‚‹ãƒˆãƒŠã‚«ã‚¤å…¨å“¡ãŒæˆ»ã£ã¦ãã‚‹ã‹ï¼Œï¼‘ï¼äººã„ã‚‹ã“ã³ã¨ã•ã‚“ã®ã†ã¡ï¼“äººãŒã‚„ã£ã¦ãã¦èµ·ã“ã—ã¦ãã‚Œã‚‹ã¾ã§ãšã£ã¨å¯ã¦ã‚‹ã¨ã„ã†ã‚ã‘ã ï¼Ž ï¼™é çµ„ã®ãƒˆãƒŠã‚«ã‚¤ã«èµ·ã“ã•ã‚ŒãŸã‚‰ï¼Œãƒãƒ¼ãƒã‚¹ã‚’ã¤ã‘ã¦ã‚½ãƒªã‚’å¼•ã‹ã›ã¦ã‚ªãƒ¢ãƒãƒ£ã‚’é…ã‚Šã«è¡Œãï¼Žé…ã‚ŠãŠã‚ã£ãŸã‚‰ãƒˆãƒŠã‚«ã‚¤ãŸã¡ã®ãƒãƒ¼ãƒã‚¹ã‚’å¤–ã™ï¼Žãã—ãŸã‚‰ãƒˆãƒŠã‚«ã‚¤ãŸã¡ã¯ä¼‘æ—¥ã ã¨ã„ã†ã“ã¨ã§ã©ã“ã‹ã«ã§ã‹ã‘ã¦ã—ã¾ã†ï¼Ž ï¼“äººçµ„ã®ã“ã³ã¨ã•ã‚“ãŸã¡ã«èµ·ã“ã•ã‚ŒãŸã‚‰ï¼Œä¼šè°ã‚’ã²ã‚‰ã„ã¦æ¬¡æœŸã®ã‚ªãƒ¢ãƒãƒ£ã‚’ã©ã†ã™ã‚‹ã‹ã‚’ã“ã³ã¨ã•ã‚“ãŸã¡ã«ä¼æŽˆã™ã‚‹ï¼Žã™ã‚“ã ã‚‰ã“ã³ã¨ã•ã‚“ãŸã¡ã¯è‡ªåˆ†ã®ä»•äº‹ã«ã‚‚ã©ã£ã¦ã„ãï¼Ž ãƒˆãƒŠã‚«ã‚¤ï¼™é çµ„ã¨ã“ã³ã¨ã•ã‚“ï¼“äººçµ„ãŒåŒæ™‚ã«ã‚µãƒ³ã‚¿ãŒèµ·ãã‚‹ã®ã‚’å¾…ã£ã¦ã‚‹å ´åˆ ã«ã¯ãƒˆãƒŠã‚«ã‚¤ã®æ–¹ã‚’å„ªå…ˆã™ã‚‹ï¼Ž ãƒˆãƒŠã‚«ã‚¤ã‚‚ã“ã³ã¨ã•ã‚“ã‚‚ã¾ãŸãã®ã†ã¡ã«ä¸‰ã€…äº”ã€…ã‚„ã£ã¦ãã‚‹ï¼Ž ä¸€æ—¦ã‚„ã£ã¦ããŸãƒˆãƒŠã‚«ã‚¤ã¯ï¼™é æƒã£
nirvash 2007/06/13
ãˆã£ã¨ã€ã¾ãšä»•æ§˜ã®æ›–æ˜§ãªéƒ¨åˆ†ã«ã¤ã„ã¦ã‚¯ãƒ©ã‚¤ã‚¢ãƒ³ãƒˆã¨æ‰“ã¡åˆã‚ã›ã‚’ã—ãªã„ã¨ã„ã‘ãªã„ã®ã‹ï¼Ÿ

Programming

algorithm
ãƒªãƒ³ã‚¯
OpenSteer
OpenSteer is a C++ library to help construct steering behaviors for autonomous characters in games and animation. In addition to the library, OpenSteer provides an OpenGL-based application called OpenSteerDemo which displays predefined demonstrations of steering behaviors. The user can quickly prototype, visualize, annotate and debug new steering behaviors by writing a plug-in for OpenSteerDemo. O
nirvash 2007/06/04
AI

algorithm

animation

games
ãƒªãƒ³ã‚¯
Steering Behaviors For Autonomous Characters
Steering Behaviors For Autonomous Characters background and update by Craig Reynolds Abstract: This paper presents solutions for one requirement of autonomous characters in animation and games: the ability to navigate around their world in a life-like and improvisational manner. These "steering behaviors" are largely independent of the particulars of the character's means of locomotion. Combinatio
nirvash 2007/05/18
ç¾¤ä½“åˆ¶å¾¡ã€‚via Radium Software Development.

AI

algorithm

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