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

agx id:agx

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

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

è¦–è¦šåŒ–ã«ã‚ˆã‚‹5ã¤ã®ã‚¬ãƒ™ãƒ¼ã‚¸ã‚³ãƒ¬ã‚¯ã‚·ãƒ§ãƒ³ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ å…¥é–€ | POSTD
ã»ã¨ã‚“ã©ã®é–‹ç™ºè€…ã¯ã€è‡ªå‹•ã®ã‚¬ãƒ™ãƒ¼ã‚¸ã‚³ãƒ¬ã‚¯ã‚·ãƒ§ãƒ³ï¼ˆGCï¼‰ã‚’å½“ãŸã‚Šå‰ã®ã‚ˆã†ã«ä½¿ã£ã¦ã„ã¾ã™ã€‚ã“ã‚Œã¯ã€ç§ãŸã¡ã®ä»•äº‹ã‚’å®¹æ˜“ã«ã™ã‚‹ãŸã‚ã«è¨€èªžãƒ©ãƒ³ã‚¿ã‚¤ãƒ ãŒæä¾›ã™ã‚‹ç´ æ™´ã‚‰ã—ã„æ©Ÿèƒ½ã®1ã¤ã§ã™ã€‚ ã—ã‹ã—ã€æœ€æ–°ã®ã‚¬ãƒ™ãƒ¼ã‚¸ã‚³ãƒ¬ã‚¯ã‚¿ã®ä¸ã‚’ã®ãžã„ã¦ã¿ã‚Œã°ã€å®Ÿéš›ã®ä»•çµ„ã¿ã¯éžå¸¸ã«ç†è§£ã—ã¥ã‚‰ã„ã“ã¨ãŒåˆ†ã‹ã‚Šã¾ã™ã€‚å®Ÿè£…ã®è©³ç´°ãŒç„¡æ•°ã«ã‚ã‚‹ãŸã‚ã€ãã‚ŒãŒä½•ã‚’ã—ã‚ˆã†ã¨ã—ã¦ã„ã‚‹ã®ã‹ã€ã¾ãŸã€ãã‚ŒãŒã¨ã‚“ã§ã‚‚ãªãé–“é•ã£ãŸäº‹æ…‹ã‚’å¼•ãèµ·ã“ã—ã‹ããªã„ã“ã¨ã«ã¤ã„ã¦ååˆ†ç†è§£ã—ã¦ã„ãªã„é™ã‚Šã€ã™ã£ã‹ã‚Šæ··ä¹±ã—ã¦ã—ã¾ã†ã§ã—ã‚‡ã†ã€‚ ãã“ã§ã€5ç¨®é¡žã®ã‚¬ãƒ™ãƒ¼ã‚¸ã‚³ãƒ¬ã‚¯ã‚·ãƒ§ãƒ³ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’æŒã¤ãŠã‚‚ã¡ã‚ƒã‚’ä½œã£ã¦ã¿ã¾ã—ãŸã€‚å°ã•ã„ã‚¢ãƒ‹ãƒ¡ãƒ¼ã‚·ãƒ§ãƒ³ã¯ãƒ©ãƒ³ã‚¿ã‚¤ãƒ ã®å‹•ä½œã‹ã‚‰ä½œæˆã—ã¾ã—ãŸã€‚ã‚‚ã£ã¨å¤§ãã„ã‚¢ãƒ‹ãƒ¡ãƒ¼ã‚·ãƒ§ãƒ³ã¨ãã‚Œã‚’ä½œæˆã™ã‚‹ã‚³ãƒ¼ãƒ‰ã¯ github.com/kenfox/gc-viz ã§è¦‹ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€‚å˜ç´”ãªã‚¢ãƒ‹ãƒ¡ãƒ¼ã‚·ãƒ§ãƒ³ã«ã‚ˆã£ã¦ã“ã†ã—ãŸé‡è¦ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’æ˜Žã‚‰ã‹ã«ã§ãã‚‹ã“ã¨ã¯
agx 2014/11/20
GC

*programming

algorithm
ãƒªãƒ³ã‚¯
ä½œã£ã¦è¦šãˆã‚‹è»¢ç½®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã€ã€Œæ¤œç´¢ã‚¨ãƒ³ã‚¸ãƒ³è‡ªä½œå…¥é–€ã€ - ãƒ—ãƒã‚°ãƒ©ãƒžã§ã‚ã‚ŠãŸã„
å…ˆè¡Œç™ºå£²ã§ã€æ¤œç´¢ã‚¨ãƒ³ã‚¸ãƒ³è‡ªä½œå…¥é–€ã‚’è³¼å…¥ã—ã¾ã—ãŸã€‚ã¾ã ãƒšãƒ©ãƒšãƒ©ã¨çœºã‚ã¦ã„ã‚‹çŠ¶æ³ã§ã™ãŒã€ã“ã‚ŒãŒéžå¸¸ã«é¢ç™½ã„ã§ã™ã€‚ ã€Œæ¤œç´¢ã‚¨ãƒ³ã‚¸ãƒ³è‡ªä½œå…¥é–€ã€ã¯ã€é›†ã‚ãŸæ–‡ç« ã‚’ã„ã‹ã«æ•´ç†ã™ã‚‹ã‹ã‚’ãƒ†ãƒ¼ãƒžã¨ã—ã¦æ‰±ã£ã¦ã„ã‚‹æœ¬ã§ã™ã€‚æ•´ç†ã™ã‚‹ã¨ã„ã†æ„å‘³ã¯ã€æ¤œç´¢ã‚¨ãƒ³ã‚¸ãƒ³ã‚’åˆ©ç”¨ã™ã‚‹ã¨ã„ã†ãƒ©ã‚¤ãƒ•ãƒãƒƒã‚¯çš„ãªæ„å‘³ã§ã¯ã‚ã‚Šã¾ã›ã‚“ã€‚æ•´ç†ã™ã‚‹ç‚ºã®æ¤œç´¢ã‚¨ãƒ³ã‚¸ãƒ³è‡ªä½“ã‚’è‡ªåˆ†ã§ä½œã‚‹ã“ã¨ã§ç†è§£ã™ã‚‹ã¨ã„ã†ã€æ¥µã‚ã¦ç¡¬æ´¾ãªæœ¬ã§ã™ã€‚ ã€Œæ¤œç´¢ã‚¨ãƒ³ã‚¸ãƒ³è‡ªä½œå…¥é–€ã€ã¨ã¯ï¼Ÿ ã€Œæ¤œç´¢ã‚¨ãƒ³ã‚¸ãƒ³è‡ªä½œå…¥é–€ã€ã¯ã€æœªè¸ITäººæç™ºæŽ˜ãƒ»è‚²æˆäº‹æ¥ã«ã‚¹ãƒ¼ãƒ‘ãƒ¼ã‚¯ãƒªã‚¨ãƒ¼ã‚¿ã«èªå®šã•ã‚ŒãŸå±±ç”°æµ©ä¹‹æ°ã¨ã€Senna/groongaã®é–‹ç™ºè€…ã®æœ«æ°¸åŒ¡æ°ã®å…±è‘—ã§ã™ã€‚æ¤œç´¢ã‚¨ãƒ³ã‚¸ãƒ³ã«ã¤ã„ã¦èªžã‚‰ã›ãŸã‚‰ã€æ—¥æœ¬ã§ã“ã‚Œä»¥ä¸Šã®äººãŸã¡ã¯ã„ãªã„ã ã‚ã†ã¨ã„ã†çµ„ã¿åˆã‚ã›ã§ã™ã€‚ã¨ã„ã†ã“ã¨ã§ã€å†…å®¹ã¯éžå¸¸ã«æ¿ƒã„ã®ã§ã™ãŒã€é›£ã—ã„å†…å®¹ã‚’è§£ã‚Šã‚„ã™ãè§£èª¬ã•ã‚Œã¦ã„ã¾ã™ã€‚ ä¸€æ–¹ã§ã€æ‰±ã£ã¦ã„ã‚‹å†…å®¹ã¯éžå¸¸ã«ãƒžãƒ‹ã‚¢ãƒƒã‚¯ã§ã™ã€‚ä¸‹ã«ç›®æ¬¡ä»˜ã‘ã¦ãŠãã®ã§è¦‹ã¦
agx 2014/09/22
algorithm

è‡ªç„¶è¨€èªžå‡¦ç†

æ¤œç´¢
ãƒªãƒ³ã‚¯
ä¸å¦ç”Ÿã«ã‚‚ã‚ã‹ã‚‹ã‚¦ã‚§ãƒ¼ãƒ–ãƒ¬ãƒƒãƒˆè¡Œåˆ— - ã‚¢ã‚¹ãƒšæ—¥è¨˜
id:echizen_tm ã•ã‚“ã®è¨˜äº‹ã€Œã‚¦ã‚§ãƒ¼ãƒ–ãƒ¬ãƒƒãƒˆæœ¨ã®åŠ¹çŽ‡çš„ã§ç°¡å˜ãªå®Ÿè£… "The Wavelet Matrix"ã€ã‹ã‚‰å§‹ã¾ã£ãŸã‚¦ã‚§ãƒ¼ãƒ–ãƒ¬ãƒƒãƒˆè¡Œåˆ—ãƒ–ãƒ¼ãƒ ã‹ã‚‰åŠå¹´ä»¥ä¸ŠãŒéŽãŽã€ã™ã§ã«æž¯ã‚ŒãŸæŠ€è¡“ã¨ã—ã¦ç¢ºç«‹ã•ã‚Œã¤ã¤ã‚ã‚‹æ„ŸãŒã‚ã‚Šã¾ã™ã€‚ â€¦å˜˜ã§ã™ã€‚ æ—¥æœ¬ä»¥å¤–ã§ã¯ã‚ã‚“ã¾ã‚Šæ¥ã¦ã„ã¾ã›ã‚“ã€‚ ç†ç”±ã¨ã—ã¦ã¯ã€ã‚„ã¯ã‚Šã‚¢ãƒ«ãƒ•ã‚¡ãƒ™ãƒƒãƒˆåœã§ã¯å˜èªžå¢ƒç•ŒãŒæ˜Žç¢ºã§ã‚ã‚‹ãŸã‚ã€ã“ã¡ã‚‰ã®è¨˜äº‹ã§æ›¸ã‹ã‚Œã¦ã„ã‚‹ã‚ˆã†ãªã€Œã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰åˆ†å‰²ã®é›£æ˜“åº¦ã€ã¨ã„ã£ãŸã“ã¨ãŒã‚ã¾ã‚Šå•é¡Œã«ãªã‚‰ãªã„ã¨ã„ã†ã“ã¨ãŒã‚ã‚‹ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ã€‚ ã¾ã‚ã€ãã†ã„ã†ã‚ã‘ã§å±€æ‰€çš„ã«æ¥ã¦ã„ã‚‹ã‚¦ã‚§ãƒ¼ãƒ–ãƒ¬ãƒƒãƒˆè¡Œåˆ—ã§ã™ãŒã€æ—¥æœ¬èªžã‚’ã¯ã˜ã‚ã¨ã™ã‚‹å˜èªžå¢ƒç•Œã®ãªã„è¨€èªžåœã«ã¨ã£ã¦ã¯é‡è¦ãªãƒã‚¿ã§ã‚ã‚‹ã¨æ€ã†ãŸã‚ã€è§£èª¬è¨˜äº‹ã‚’æ›¸ãç›´ã—ã¦*1ã¿ã‚ˆã†ã¨æ€ã„ã¾ã™ã€‚ ã‚¦ã‚§ãƒ¼ãƒ–ãƒ¬ãƒƒãƒˆè¡Œåˆ—ã§ã§ãã‚‹ã“ã¨ ä¸»ã¨ãªã‚‹æ“ä½œã¯ã€æ–‡å—åˆ—ã«å¯¾ã™ã‚‹ å®šæ•°æ™‚é–“ã® rank() ã¨ select()*2 ã§ã™ã€‚ rank() ã¯ã€ã€Œæ–‡
agx 2013/03/06
algorithm
ãƒªãƒ³ã‚¯
MapReduceã§ãã‚‹10å€‹ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ - ã€Žä¼æ¥æˆé•·ã®æ–¹ç¨‹å¼ â€• AIDã‚°ãƒãƒ¼ã‚¹ã‚³ãƒŸãƒƒãƒˆã«ã‚ˆã‚‹æˆé•·æˆ¦ç•¥ã€
Hadoopã¨Mahoutã«ã‚ˆã‚Šã€ãƒ“ãƒƒã‚°ãƒ‡ãƒ¼ã‚¿ã§ã‚‚æ©Ÿæ¢°å¦ç¿’ã‚’è¡Œã†ã“ã¨ãŒã§ãã¾ã™ã€‚Mahoutã§å®Ÿè£…ã•ã‚Œã¦ã„ã‚‹æ‰‹æ³•ã¯ã€å…¨ã¦åˆ†æ•£å‡¦ç†ã§ãã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã„ã†ã“ã¨ã«ãªã‚Šã¾ã™ã€‚Mahoutã§å®Ÿè£…ã•ã‚Œã¦ã„ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ã€ã“ã“ã«åˆ—æŒ™ã•ã‚Œã¦ã„ã¾ã™ã€‚è«–æ–‡ã¨ã—ã¦ã‚‚ã€2006å¹´ã«ã€ŒMap-Reduce for Machine Learning on Multicoreã€ã¨ã—ã¦ã„ãã¤ã‹ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒç´¹ä»‹ã•ã‚Œã¦ã„ã¾ã™ã€‚ ãã“ã§ä»Šå›žã¯ã€ï¼ˆä½•ç•ªç…Žã˜ã‹åˆ†ã‹ã‚Šã¾ã›ã‚“ãŒè‡ªåˆ†ã®ç†è§£ã®ãŸã‚ã«ã‚‚ï¼‰ã“ã®è«–æ–‡ã§ç´¹ä»‹ã•ã‚Œã¦ã„ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã€ã©ã†ã‚„ã£ã¦åˆ†æ•£å‡¦ç†ã™ã‚‹ã®ã‹ã‚’ç°¡å˜ã«ãƒ¡ãƒ¢ã—ã¦ãŠããŸã„ã¨æ€ã„ã¾ã™ã€‚è¨ˆç®—ã™ã‚‹ã¹ãçµ±è¨ˆé‡ãŒã€summation formï¼ˆè¶³ã—ç®—ã§è¡¨ç¾ã§ãã‚‹å½¢ï¼‰ã«ãªã£ã¦ã„ã‚‹ã‹ã©ã†ã‹ãŒã€é‡è¦ãªãƒã‚¤ãƒ³ãƒˆã§ã™ã€‚ãªã£ã¦ãªã„å ´åˆã¯ã€â€ã†ã¾ãâ€MapReduceã®å½¢ã«ãƒãƒ©ã™å¿…è¦ãŒã‚ã‚Šã¾ã™ã€‚ â€»ä¾‹ã«ã‚ˆã£ã¦ã€é–“é•ã„ãŒã‚ã£ãŸå ´åˆã¯éšæ™‚
agx 2012/05/31
algorithm

æ©Ÿæ¢°å¦ç¿’
ãƒªãƒ³ã‚¯
ã—ã‹ã—SVMã‚‚æœ€è¿‘ã¯é€Ÿã„ã‚‰ã—ã„ - å°„æ’ƒã—ã¤ã¤å‰è»¢ æ”¹
Complement Naive BayesãŒSVMã‚ˆã‚Šé€Ÿã„ã‚ˆãƒ¼ã¨ä¸»å¼µã—ã¦ã„ãŸã®ã§ã€SVMã‚‚ãªã‚“ã‹æœ€è¿‘ã¯é€Ÿããªã£ã¦ã‚‹ã‚‰ã—ã„ã‚ˆã€ã¨ã„ã†äº‹ã‚’ç´¹ä»‹ã—ã¦ã¿ãŸã„ã€‚è¿‘å¹´ã¯SVMãªã©ã®å¦ç¿’ã‚’é«˜é€Ÿã«è¡Œã†ã¨ã„ã†ææ¡ˆãŒè¡Œã‚ã‚Œã¦ãŠã‚Šã€å®Ÿè£…ãŒå…¬é–‹ã•ã‚Œã¦ã„ã‚‹ã‚‚ã®ã‚‚ã‚ã‚‹ã€‚ãã®ä¸ã®ä¸€ã¤ã«liblinearã¨ã„ã†æ©Ÿæ¢°å¦ç¿’ãƒ©ã‚¤ãƒ–ãƒ©ãƒªãŒã‚ã‚‹ã€‚ãƒ©ã‚¤ãƒ–ãƒ©ãƒªåã‹ã‚‰æŽ¨æ¸¬ã§ãã‚‹é€šã‚Šã€liblinearã§ã¯ã‚«ãƒ¼ãƒãƒ«ã‚’ä½¿ã†ã“ã¨ãŒå‡ºæ¥ãªã„ã€‚ã—ã‹ã—ã€ãã®åˆ†é€Ÿåº¦ãŒé€Ÿãã€å¤§è¦æ¨¡ãƒ‡ãƒ¼ã‚¿ã«é©ç”¨ã§ãã‚‹ã¨ã„ã†åˆ©ç‚¹ãŒã‚ã‚‹ã€‚ liblinearã‚’ä½œã£ã¦ã„ã‚‹ã®ã¯libsvmã¨åŒã˜ç ”ç©¶ã‚°ãƒ«ãƒ¼ãƒ—ã§ã€Chih-Jen LinãŒãƒ—ãƒã‚¸ã‚§ã‚¯ãƒˆãƒªãƒ¼ãƒ€ãƒ¼ã§ã‚ã‚‹ã‚ˆã†ã ã€‚libsvmã¯ã‹ãªã‚Šæœ‰åãªãƒ©ã‚¤ãƒ–ãƒ©ãƒªã§ã€liblinearã«ã¯ãã†ã„ã£ãŸæ„å‘³ã§å®‰å¿ƒæ„ŸãŒã‚ã‚‹ã€‚ï¼ˆliblinearã®æ–¹ã¯å…¬é–‹ã•ã‚Œã¦ã—ã°ã‚‰ãã¯å‰²ã¨ãƒã‚°ãŒã‚ã£ãŸã‚‰ã—ã„ã‘ã©ã€‚ï¼‰ liblinearã«ã¯L1-SVM, L
agx 2009/01/31
algorithm

machine learning
ãƒªãƒ³ã‚¯
The mathematics behind the Droste effect. This article uses jsMath which requires Java.
The mathematics behind the Droste effect. This article uses jsMath which requires Java.Posted on 2008-12-26 21:20 A logarithmic image transf ormation Jos Leys AbstractÂ : An image transf ormation method, first used by the artist M.C. Escher, and described by Lenstra et al. is generalized for use in a graphics program. Figure 1: Escher's "Printgallery"[1] In 1956, Maurits Cornelis Escher completed a d
agx 2008/12/30
ã‚¨ãƒƒã‚·ãƒ£ãƒ¼é¢¨ã®ç”»åƒã‚’ç”Ÿæˆã™ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®è«–æ–‡

ç”»åƒå‡¦ç†

algorithm
ãƒªãƒ³ã‚¯
DO++ : é€éŽçš„ãƒ‡ãƒ¼ã‚¿åœ§ç¸®
å¯é€†ãƒ‡ãƒ¼ã‚¿åœ§ç¸®åˆ†é‡Žã§ã€ç¾åœ¨ç ”ç©¶ãŒç››ã‚“ãªåˆ†é‡Žã®ä¸€ã¤ãŒã€ãƒ‡ãƒ¼ã‚¿ã‚’åœ§ç¸®ã—ãŸçŠ¶æ…‹ã®ã¾ã¾å®šæ•°æ™‚é–“ã§ãƒ©ãƒ³ãƒ€ãƒ ã‚¢ã‚¯ã‚»ã‚¹ã‚’ã‚µãƒãƒ¼ãƒˆã™ã‚‹ãƒ‡ãƒ¼ã‚¿åœ§ç¸®æ–¹å¼ã§ã™ï¼ˆword RAMãƒ¢ãƒ‡ãƒ«ã§O(log n)ã‚µã‚¤ã‚ºã®å¾©å…ƒãŒå®šæ•°æ™‚é–“)ã€‚ ã“ã‚Œã¯ã€ãƒ‡ãƒ¼ã‚¿ã‚’ã‚ãŸã‹ã‚‚åœ§ç¸®ã—ã¦ã„ãªã„ã‹ã®ã‚ˆã†ã«æ‰±ãˆã‚‹ãŸã‚ã€é€éŽçš„ãƒ‡ãƒ¼ã‚¿åœ§ç¸®/æ§‹é€ ã¨å‘¼ã°ã‚Œã¦ã„ã¾ã™ï¼ˆè‹±èªžã ã¨ã¾ã æ±ºã¾ã£ã¦ãªã„ï¼Ÿ)ã€‚ ä¾‹ãˆã°1GBã®ãƒ‡ãƒ¼ã‚¿ã‚’åœ§ç¸®ã—ãŸçŠ¶æ…‹ã§ã€é€”ä¸300MBç›®ã‹ã‚‰4Byteã ã‘å¾©å…ƒã—ã‚ˆã†ã¨ã„ã†ã®ãŒå®šæ•°æ™‚é–“ã§å®Ÿç¾ã§ãã‚‹ã‚ã‘ã§ã™ã€‚ã“ã‚Œã¯ç†è«–çš„ã«ã‚‚ã‹ãªã‚Šå¼·ã„ã“ã¨ã‚’ã„ã£ã¦ã„ã¦ï¼Œä¾‹ãˆã°ä»Šã‚ã‚‹ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒã€O(T)æ™‚é–“ã§ã‚ã‚‹å•é¡Œã‚’è§£ã‘ã‚‹ã¨ã„ã†ã®ãŒã‚ã£ãŸã‚‰ã€ãã‚Œã‚’å…¨ãåŒã˜O(T)æ™‚é–“ã®ã¾ã¾ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚’åœ§ç¸®ã—ä½œæ¥é ˜åŸŸé‡ã‚’æ¸›ã‚‰ã™ã“ã¨ãŒã§ãã¾ã™ (ä¸€å¿œãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«å¯¾ã—èªã¿è¾¼ã¿æ“ä½œã—ã‹ç„¡ã„å ´åˆã€‚æ›¸ãè¾¼ã¿ã‚‚ã‚ã‚‹å ´åˆã¯ã¾ãŸã¡ã‚‡ã£ã¨é¢å€’ã«ãªã‚‹ï¼‰ ã“ã®ãƒ‡ãƒ¼ã‚¿ã‚’åœ§ç¸®ã—ãŸã¾ã¾æ‰±ã†
agx 2008/12/29
ãƒ‡ãƒ¼ã‚¿ã‚’åœ§ç¸®ã—ãŸçŠ¶æ…‹ã®ã¾ã¾å®šæ•°æ™‚é–“ã§ãƒ©ãƒ³ãƒ€ãƒ ã‚¢ã‚¯ã‚»ã‚¹ã‚’ã‚µãƒãƒ¼ãƒˆã™ã‚‹ãƒ‡ãƒ¼ã‚¿åœ§ç¸®æ–¹å¼

algorithm

åœ§ç¸®
ãƒªãƒ³ã‚¯
GitHub - livedoor/cicindela2: a highly customizable recommendation engine written in perl + MySQL
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert
agx 2008/12/24
algorithm

library

perl
ãƒªãƒ³ã‚¯
é«˜é€Ÿã‹ã¤çœãƒ¡ãƒ¢ãƒªã§æ–‡å—åˆ—ã‚’æ‰±ã†ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã€Œwavelet treeã€
ã¯ã˜ã‚ã« å¤§è¦æ¨¡ãªãƒ‡ãƒ¼ã‚¿ã‚’æ‰±ã†ã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³ã§ã¯ã€é€Ÿåº¦ã¨ã¨ã‚‚ã«ä½œæ¥é ˜åŸŸé‡ã‚‚å¤§ããªå•é¡Œã¨ãªã‚Šã¾ã™ã€‚ä½œæ¥é ˜åŸŸãŒãƒ¡ã‚¤ãƒ³ãƒ¡ãƒ¢ãƒªã«åŽã¾ã‚‰ãªã„å ´åˆã€ã‚¹ãƒ¯ãƒƒãƒ”ãƒ³ã‚°ãŒç™ºç”Ÿã—ã€å¤§å¹…ãªé€Ÿåº¦ä½Žä¸‹ã«ã¤ãªãŒã‚Šã¾ã™ã€‚ãã®ãŸã‚è¿‘å¹´ã€ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¯é«˜é€Ÿãªã ã‘ã§ãªãã€ä½œæ¥é ˜åŸŸé‡ãŒå°ã•ã„ã“ã¨ã‚‚æ±‚ã‚ã‚‰ã‚Œã¦ã„ã¾ã™ã€‚ä»Šå›žç´¹ä»‹ã™ã‚‹ã®ã¯2003å¹´ã«ææ¡ˆã•ã‚ŒãŸãƒ‡ãƒ¼ã‚¿æ§‹é€ ã€wavelet treeï¼ˆä»¥ä¸‹ã€ŒWTã€ã¨è¡¨è¨˜ï¼‰ã§ã™ã€‚WTã¯åœ§ç¸®ç´¢å¼•ã‚„Succinct Data Structureãªã©ã€ãƒ‡ãƒ¼ã‚¿ã‚’ã‚³ãƒ³ãƒ‘ã‚¯ãƒˆã«è¡¨ç¾ã™ã‚‹éš›ã«é‡è¦ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã™ã€‚WTã¯æ–‡å—åˆ—T[0...n-1]ãŒä¸Žãˆã‚‰ã‚ŒãŸæ™‚ã€æ¬¡ã®2ã¤ã®æ“ä½œã‚’å®šæ•°æ™‚é–“ã§ã‚µãƒãƒ¼ãƒˆã—ã¾ã™ã€‚ rank(p, c)â€•â€•T[0...p]ä¸ã®cã®å‡ºç¾å›žæ•°ã‚’è¿”ã™ select(i, c)â€•â€•(i+1)ç•ªç›®ã®cã®ä½ç½®ã‚’è¿”ã™ WTã®ä½œæ¥é ˜åŸŸé‡ã¯ã€æ–‡å—åˆ—ã‚’ãã®ã¾ã¾ä¿å˜ã—ãŸæ™‚ã®ç´„2å€ç¨‹åº¦ã§ã™ã€‚ å¯¾è±¡èªè€… C++ã®
agx 2008/12/17
text

algorithm
ãƒªãƒ³ã‚¯
ORWiki
ORå¦ä¼š50å¹´ã®æ´å²ã®ä¸ã§ï¼ŒORäº‹å…¸ã®ç·¨çº‚ãƒ»æ”¹è¨‚ã¯é€šç®—ï¼“åº¦ç›®ã¨ãªã‚‹ï¼Žã„ã‚ã„ã‚ãªç†ç”±ã‹ã‚‰ORäº‹å…¸ç·¨é›†å§”å“¡ä¼šã¯ï¼Œã€ŒORäº‹å…¸ã€ã‚’Webã«å…¬é–‹ã™ã‚‹ã¨ã„ã†æ‰‹æ®µã‚’ã¨ã‚‹ã“ã¨ã«ãªã£ãŸï¼Žå‰å›žã¯CDã«ã‚ˆã‚‹å‡ºç‰ˆã§ã‚ã£ãŸï¼Ž è³‡æ–™ç·¨ã ã‘ã¯ã€ŒORäº‹å…¸ã€ã‹ã‚‰åˆ‡ã‚Šé›¢ã—ã¦ï¼ŒORå¦ä¼šã®é€šå¸¸ã®ãƒ›ãƒ¼ãƒ ãƒšãƒ¼ã‚¸ã®ä¸ã«ç§»ã™ã“ã¨ã«ãªã£ãŸï¼Žã“ã‚Œã¯é€†ç€¬å·æµ©åå§”å“¡é•·ã®ã‚¢ã‚¤ãƒ‡ã‚£ã‚¢ã§ã‚ã‚‹ã€‚å†…å®¹ã®æ€§æ ¼ä¸Šï¼Œè³‡æ–™è¿½åŠ ã‚‚é–“é•ã„ã®è¨‚æ£ã‚‚åºƒå ±å§”å“¡ä¼šã®è²¬ä»»ã§ç°¡å˜ã«å‡ºæ¥ã‚‹ã‚ˆã†ã«ãªã‚‹ï¼Ž å‰å›žã¾ã§ã®å¦ä¼šã®æ´å²è³‡æ–™ã¯ãã®ã¾ã¾æ®‹ã—ã¦ã‚ã‚‹ï¼Žä»Šå›žã¯ãƒ‡ãƒ¼ã‚¿è¿½åŠ ä½œæ¥ã‚’åŸºæœ¬ã«å¤šå°‘ã®è³‡æ–™è¿½åŠ ã‚’è¡Œã£ãŸï¼Žå‰äº‹å‹™å±€é•·ã®è—¤æœ¨ç§€å¤«ã•ã‚“ã«ã¯ï¼Œãã®å¾Œã®å¦ä¼šæ´»å‹•å…¨èˆ¬ã«ã‚ãŸã‚‹è¨˜éŒ²ã‚’ã¾ã¨ã‚ã¦åŽŸç¨¿ã‚’ä½œæˆã—ã¦ã‚‚ã‚‰ã£ãŸï¼Žå¦è¡“ä¼šè°é–¢ä¿‚ã‚‚è—¤æœ¨ã•ã‚“ãŒå‰å›žã®å½¢å¼ã«ç¿’ã£ã¦è³‡æ–™åŽŸç¨¿ã‚’ä½œæˆã—ï¼ŒFMESä¼šé•·ã®é«˜æ©‹å¹¸é›„ã•ã‚“ã«ç›®ã‚’é€šã—ã¦ã„ãŸã ã„ãŸï¼Ž å„æ”¯éƒ¨ã‹ã‚‰å¢—è£œè¿½åŠ ã®åŽŸç¨¿ãŒé€ã‚‰ã‚Œã¦ããŸï¼ŽWebã®ã‚µãƒ³ãƒ—ãƒ«ã‚’è¦‹ã¦ãã ã•ã„ã¨è¨€ã£ã¦
agx 2008/12/13
ã¾ã¨ã‚

algorithm

æ•°å¦

learning
ãƒªãƒ³ã‚¯
å˜ç´”ã§æ£ã—ãã†ãªã‚‚ã®ãŒæ£ã—ã„ã¨ã¯é™ã‚‰ãªã„ - Radium Software
Coding Horror: The Danger of NaÃ¯vetÃ© é…åˆ—ã®ä¸èº«ã‚’ãƒ©ãƒ³ãƒ€ãƒ ãªé †åºã«ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã™ã‚‹ã‚³ãƒ¼ãƒ‰ã‚’æ›¸ããŸã„ã€‚å˜ç´”ã§ã„ã„ã‹ã‚‰åˆ†ã‹ã‚Šã‚„ã™ãã¦é–“é•ã„ã®ç„¡ã„ã‚³ãƒ¼ãƒ‰ã‚’æ›¸ã“ã†ã€‚ä¾‹ãˆã°ï¼Œã“ã‚“ãªæ„Ÿã˜ã«â€¦â€¦ for (int i = 0; i < cards.Length; i++) { int n = rand.Next(cards.Length); Swap(ref cards[i], ref cards[n]); } ã“ã‚Œã¯å˜ç´”ã§åˆ†ã‹ã‚Šã‚„ã™ã„ï¼ ã§ã‚‚æ®‹å¿µï¼ ã“ã®ã‚³ãƒ¼ãƒ‰ã¯é–“é•ã£ã¦ã„ã‚‹ã€‚ã‚·ãƒ£ãƒƒãƒ•ãƒ«å¾Œã®é †åºã«åã‚ŠãŒå‡ºã¦ã—ã¾ã†ã€‚æ£è§£ã¯ã“ã¡ã‚‰ã€‚ for (int i = cards.Length - 1; i > 0; i--) { int n = rand.Next(i + 1); Swap(ref cards[i], ref cards[n]); } ã±ã£ã¨è¦‹ã¦é•ã„ãŒåˆ†ã‹ã‚‹ï¼Ÿ ã‚¤ãƒ³
agx 2008/12/09
code

è€ƒå¯Ÿ

algorithm
ãƒªãƒ³ã‚¯
Using Photographs to Enhance Videos of a Static Scene
Abstract We present a framework for automatically enhancing videos of a static scene using a few photographs of the same scene. For example, our system can transfer photographic qualities such as high resolution, high dynamic range and better lighting from the photographs to the video. Additionally, the user can quickly modify the video by editing only a few still images of the scene. Finally, our
agx 2008/12/03
ç”»åƒå‡¦ç†

algorithm
ãƒªãƒ³ã‚¯
Some more advanced GC techniques
After my last two posts about garbage collection, some people people suggested some more advanced techniques be used to solve the pausing probl em. Here's a quick* overview of some more advanced techniques, some of which can eliminate noticeable pauses and some of which can solve other probl ems in GC. The train algorithm The idea of the train algorithm is to break the heap (or, really, just the old
agx 2008/04/04
GC ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã„ã‚ã„ã‚

algorithm

GC
ãƒªãƒ³ã‚¯
è¦†é¢ã—ã¦ã„ã¦ã‚‚é¡”èªè˜ã§ãã‚‹æ–°ã—ã„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ | WIRED VISION
è¦†é¢ã—ã¦ã„ã¦ã‚‚é¡”èªè˜ã§ãã‚‹æ–°ã—ã„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 2008å¹´3æœˆ26æ—¥ ã‚µã‚¤ã‚¨ãƒ³ã‚¹ãƒ»ãƒ†ã‚¯ãƒŽãƒã‚¸ãƒ¼ ã‚³ãƒ¡ãƒ³ãƒˆï¼š ãƒˆãƒ©ãƒƒã‚¯ãƒãƒƒã‚¯ (0) Bryan Gardiner Allen Yangæ°ã®é¡”èªè˜ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ä½¿ã†ã¨ã€ãŸã¨ãˆç”»åƒãŒç ´æã—ã¦ã„ãŸã‚Šã€éƒ¨åˆ†çš„ã«ã•ãˆãŽã‚‰ã‚Œã¦ã„ã¦ã‚‚ã€è©²å½“ã™ã‚‹äººç‰©ã‚’çš„ç¢ºã«è¦‹ã¤ã‘å‡ºã™ã“ã¨ãŒå¯èƒ½ã ã€‚Photo: Allen Yang å¿è€…ã®è¦†é¢ã¯ã‚‚ã†æ„å‘³ãŒãªã„ã€‚ã‚«ãƒªãƒ•ã‚©ãƒ«ãƒ‹ã‚¢å¤§å¦ãƒãƒ¼ã‚¯ãƒ¬ãƒ¼æ ¡ã¨ã‚¤ãƒªãƒŽã‚¤å¤§å¦ã‚¢ãƒ¼ãƒãƒŠãƒ»ã‚·ãƒ£ãƒ³ãƒšãƒ¼ãƒ³æ ¡(UIUC)ã®ç ”ç©¶è€…ãŸã¡ãŒé–‹ç™ºã—ãŸæ–°ã—ã„é¡”èªè˜ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ã€ãŸã¨ãˆç›®ã€é¼»ã€å£ã®éƒ¨åˆ†ãŒä¸æ˜Žçžã§ã‚‚ã€90ï¼…ã‹ã‚‰95ï¼…ã®æ£ç¢ºã•ã§å€‹äººã®é¡”ã‚’èªè˜ã§ãã‚‹ã®ã ã€‚ ã€Œå¤šãã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã¯ã€ç›®ã€é¼»ã€å£ã¨ã„ã£ãŸã„ã‚ã‚†ã‚‹é‡è¦ãªé¡”ã®ç‰¹å¾´ã‚’ä½¿ã£ã¦å€‹äººã‚’ç¢ºèªã—ã¦ã„ã‚‹ã€ã¨ã€æ–°ã—ã„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’é–‹ç™ºã—ãŸãƒãƒ¼ã‚¯ãƒ¬ãƒ¼æ ¡å·¥å¦éƒ¨ã®ç ”ç©¶è€…Allen Yangæ°ã¯è¿°ã¹ã‚‹ã€‚ ã€Œã—ã‹ã—ã€ãã‚Œã ã¨
agx 2008/03/29
algorithm

ç”»åƒå‡¦ç†
ãƒªãƒ³ã‚¯
ã„ã‚ã„ã‚ãªæ›²ç·š
ã‚°ãƒ©ãƒ•æç”»ã«ã¤ã„ã¦ã®æŒ‡é‡ ã‚°ãƒ©ãƒ•ã‚’èª¿ã¹ã‚‹å ´åˆã€æ¬¡ã®ã“ã¨ã‚’å¿µé ã«ãŠã„ã¦è¨ˆç®—ã‚’é€²ã‚ã‚Œã°ã‚ˆã„ã€‚ ï¼ˆï¼‘ï¼‰ã€€æ›²ç·šã®å˜åœ¨ç¯„å›²ï¼ˆExistence)ã‚„åº§æ¨™è»¸ã«å¯¾ã™ã‚‹å¯¾ç§°æ€§(Symmetry) ï¼ˆï¼’ï¼‰ã€€åº§æ¨™è»¸ã¨ã®äº¤ç‚¹(Intersection)ã‚„æ›²ç·šä¸Šã®ç‰¹æ®Šãªç‚¹ã®åº§æ¨™(Special point) ï¼ˆï¼“ï¼‰ã€€é–¢æ•°ã®å¢—æ¸›ã¨æ¥µå€¤(One) ï¼ˆï¼”ï¼‰ã€€é–¢æ•°ã®å‡¹å‡¸ã¨å¤‰æ›²ç‚¹(Two) ï¼ˆï¼•ï¼‰ã€€æ¼¸è¿‘ç·š(Straight line) ç§ã®é«˜æ ¡æ™‚ä»£ã€ä¸Šè¨˜æ‰‹é †ã‚’è¦šãˆã‚‹ãŸã‚ã«é æ–‡å—ã‚’ã¤ãªãŽåˆã‚ã›ã¦ã€ ï¼³ï¼¥ï¼³ï¼©ï¼¯ï¼´ï¼³ï¼ˆã‚»ã‚·ã‚ªãƒƒãƒ„ï¼‰ ãªã©ã¨ã„ã†èªžå‘‚åˆã‚ã›ã‚’è€ƒæ¡ˆã—ãŸã‚‚ã®ã ã€‚ ä¾‹ã€€æ›²ç·š ï¼¹ï¼’ï¼ï¼¸ï¼’(ï¼‘ï¼ï¼¸ï¼’) ã®ã‚°ãƒ©ãƒ•ã‚’æã„ã¦ã¿ã‚ˆã†ã€‚ å¼ã®ç‰¹å¾´ã‹ã‚‰ã€æ›²ç·šã¯ã€ï¼¸è»¸ã«é–¢ã—ã¦å¯¾ç§°ã€ï¼¹è»¸ã«é–¢ã—ã¦å¯¾ç§°ã€åŽŸç‚¹ã«é–¢ã—ã¦å¯¾ç§°ã§ã‚ã‚‹ ã®ã§ã€è¨ˆç®—ã™ã‚‹ç¯„å›²ã‚’ã€ï¼¸â‰§ï¼ã€ï¼¹â‰§ï¼ ã¨ã—ã¦ã‚ˆã„ã€‚ã•ã‚‰ã«ã€ï¼¹ï¼’â‰§ï¼ ã§ã‚ã‚‹ã®ã§ã€ ï¼â‰¦ï¼¸â‰¦ï¼‘ ã¨ã—ã¦ã‚ˆã„ã€‚ã“ã®ã¨ãã€ä¸Žãˆã‚‰
agx 2008/01/28
æ•°å¦

algorithm
ãƒªãƒ³ã‚¯
accelerated PBN : NMFã®ãŸã‚ã®æ–°ã—ã„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
no room for squareshttp://www.bsp.brain.riken.jp/publications/2006/ICA-2006-final-Springer.pdf ã“ã®ãƒªãƒ³ã‚¯å…ˆã®è«–æ–‡ã«ã‚ã‚‹ï¼ŒNMF(non-negative matrix factorization)ã®ãŸã‚ã®ï¼Œæ–°ã—ã„ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’è©¦ã—ã¦ã„ã¾ã™ï¼Žç¢ºã‹ã«ï¼ŒLee-Seungã®åŽŸè«–æ–‡ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚ˆã‚Šï¼ŒåŽæŸãŒè‰¯ã„ã§ã™ï¼Žã¤ã¾ã‚Šï¼Œã‚ˆã‚Šå°‘ãªã„iterationã§ï¼Œã‚ˆã‚Šå…ƒã®è¡Œåˆ—ã«è¿‘ã„è¡Œåˆ—ãŒå¾—ã‚‰ã‚Œã¾ã™ï¼Žçš†ã•ã‚“ã‚‚ãœã²ä¸€åº¦ï¼ŒãŠè©¦ã—ã‚ã‚Œï¼Žå®Ÿè£…ã‚‚ï¼Œã‹ã‚“ãŸã‚“ã§ã™ï¼Ž
agx 2008/01/21
algorithm
ãƒªãƒ³ã‚¯
ã‚«ãƒ³ã‚¬ãƒ«ãƒ¼ãƒã‚¦ã‚¹ï¼šãƒ†ã‚ã‚¹ãƒˆãƒ©ã‚¤ãƒ–ãƒ©ãƒªï¼š2007å¹´7æœˆ A*ï¼ˆA-starï¼šã‚¨ãƒ¼ã‚¹ã‚¿ãƒ¼ï¼‰æŽ¢ç´¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
agx 2007/11/29
algorithm
ãƒªãƒ³ã‚¯
å¸‚è²©GPUã‚’ä½¿ã£ã¦ãƒ‘ã‚¹ãƒ¯ãƒ¼ãƒ‰ã‚’é«˜é€Ÿã‚¯ãƒ©ãƒƒã‚¯ - Engadget Japanese
Paramount+ annual subscriptions are 50 percent off right nowThe discount applies to both the Essential and Premium plans. This Apple Music promotion gives new subscribers three free months of the Family PlanApple Music has a good deal for new subscribers. The Family Plan is free for three months if you don't already pay for a tier.
agx 2007/11/01
Security

algorithm

technology
ãƒªãƒ³ã‚¯
Mostly-Concurrent Mark & Sweep GC ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ç›®æ¬¡ 1. å‰ç½®ã 2. HotSpot VM 1.4.x ã® GC ã®ç¨®é¡ž 3. Mostly-concurrent Mark & Sweep 4. å¿œç”¨ 4.1 ä¸–ä»£åˆ¥ GC ã¨ã®çµ„ã¿åˆã‚ã› 4.2 ã‚«ãƒ¼ãƒ‰ãƒžãƒ¼ã‚ãƒ³ã‚° (Card Marking) 4.3 ä¸¦åˆ—åŒ– (Parallel GC) 4.4 ãƒ“ãƒƒãƒˆãƒ¯ã‚¤ã‚ºãƒ»ã‚¹ã‚¤ãƒ¼ãƒ— (Bitwise Sweep) 4.5 ã‚¤ãƒ³ã‚¯ãƒªãƒ¡ãƒ³ã‚¿ãƒ«ãƒ»ã‚³ãƒ³ãƒ‘ã‚¯ã‚·ãƒ§ãƒ³ (Incremental Compaction) 5. å‚è€ƒæ–‡çŒ® è„šæ³¨ ã‚³ãƒ¡ãƒ³ãƒˆ 1. èƒŒæ™¯ ã‚¬ãƒ¼ãƒ™ãƒ¼ã‚¸ã‚³ãƒ¬ã‚¯ã‚·ãƒ§ãƒ³(GC) ã«ã¯è‰²ã€…ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒå˜åœ¨ã™ã‚‹ãŒã€å¤§é›‘æŠŠã«è¨€ã£ã¦ Stop-the-World (STW) åž‹ GC ã¨ On-the-fly åž‹ GC ã«å¤§åˆ¥ã•ã‚Œã‚‹ã€‚ STW åž‹ã® GC ã¯ãƒ—ãƒã‚°ãƒ©ãƒ ã®å®Ÿè¡Œä¸ã«ã¯ã‚¬ãƒ¼ãƒ™ãƒ¼ã‚¸ã®å›žåŽã‚’è¡Œã‚ãšã€ãƒ¡ãƒ¢ãƒªãŒæž¯æ¸‡ã—ãŸæ™‚ã«ãªã£ã¦å§‹ã‚ã¦ã‚¬ãƒ¼ãƒ™ãƒ¼ã‚¸ã®å›ž
agx 2007/11/01
Java ã®GCã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

algorithm

GC

Java
ãƒªãƒ³ã‚¯
lucille development blog Â» Blog Archive Â» Xorshift RNGs
Weâ€™re getting things ready Loading your experienceâ€¦ This wonâ€™t take long.
agx 2007/09/01
xorã¨ã‚·ãƒ•ãƒˆã‚’ä½¿ã†ã ã‘ã®è¶…é«˜é€Ÿãªæ“¬ä¼¼ä¹±æ•°ç”Ÿæˆå™¨

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