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

y_yanbe id:y_yanbe

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

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

Ant colony optimization algorithms - Wikipedia
This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages) This article possibly contains original research. Please improve it by verifying the claims made and adding inline citations. Statements consisting only of original research should be removed. (August 2018) (Learn how and when to remove this message) This
y_yanbe 2010/09/09
èŸ»ãŒã‚¨ã‚µã«ã‚ã‚Šã¤ãä»•çµ„ã¿ã‚’åˆ©ç”¨ã—ãŸAIã®åˆ†é‡Žã§ä½¿ã‚ã‚Œã¦ã„ã‚‹æœ€é©åŒ–ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

algorithm
ãƒªãƒ³ã‚¯
K-meansæ³•ã«ã‚ˆã‚‹ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã®ã‚¹ãƒžãƒ¼ãƒˆãªåˆæœŸå€¤é¸æŠžã‚’è¡Œã†K-means++ - kaisehã®ãƒ–ãƒã‚°
K-meansæ³•ã¯ã€å…¥åŠ›ãƒ‡ãƒ¼ã‚¿ã‹ã‚‰Kå€‹ã®ãƒ©ãƒ³ãƒ€ãƒ ãªå€‹ä½“ã‚’åˆæœŸã‚¯ãƒ©ã‚¹ã‚¿ã®ä¸å¿ƒã¨ã—ã¦é¸æŠžã—ã€ä»¥é™ã€ã‚¯ãƒ©ã‚¹ã‚¿ã®é‡å¿ƒã‚’ç§»å‹•ã•ã›ã‚‹ã‚¹ãƒ†ãƒƒãƒ—ã‚’ç¹°ã‚Šè¿”ã™ã“ã¨ã§ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã‚’è¡Œã†éžéšŽå±¤çš„æ‰‹æ³•ã§ã™ã€‚K-meansæ³•ã¯ã‚·ãƒ³ãƒ—ãƒ«ã§é«˜é€Ÿã§ã™ãŒã€åˆæœŸå€¤ä¾å˜ãŒå¤§ãã„ã®ãŒå¼±ç‚¹ã§ã€ä¸é©åˆ‡ãªåˆæœŸå€¤é¸æŠžã‚’ã™ã‚‹ã¨é–“é•ã£ãŸè§£ã«åŽæŸã—ã¦ã—ã¾ã„ã¾ã™ã€‚ ä»¥ä¸‹ã¯ã€Introduction to Information Retrievalã®16ç« ã«å‡ºã¦ãã‚‹ä¾‹ã§ã™ã€‚ {d1, d2, ..., d6}ã‚’K=2ã§ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã™ã‚‹å ´åˆã€{{d1, d2, d4, d5}, {d3, d6}}ãŒå¤§åŸŸæœ€é©è§£ã§ã™ãŒã€åˆæœŸã‚¯ãƒ©ã‚¹ã‚¿ã®ä¸å¿ƒã‚’d2, d5ã§ä¸Žãˆã‚‹ã¨ã€{{d1, d2, d3}, {d4, d5, d6}}ã¨ã„ã†èª¤ã£ãŸè§£ã«åŽæŸã—ã¦ã—ã¾ã„ã¾ã™ã€‚ ã“ã®å•é¡Œã‚’æ”¹å–„ã™ã‚‹K-means++ã¨ã„ã†æ‰‹æ³•ã‚’è¦‹ã¤ã‘ãŸã®ã§ã€è©¦ã—ã¦ã¿ã¾ã—ãŸã€‚ K-means+
y_yanbe 2010/05/25
research

algorithm

clustering
ãƒªãƒ³ã‚¯
æœ¬ç‰©ã¨è¦‹é•ãˆã‚‹ã‚ˆã†ãªç”»åƒè£œé–“ã‚’å®Ÿç¾ã™ã‚‹ãƒ‘ã‚¹ãƒ•ãƒ¬ãƒ¼ãƒ ãƒ¯ãƒ¼ã‚¯æ‰‹æ³• - A Successful Failure
SIGGRAPH2009ã§ç™ºè¡¨ã•ã‚ŒãŸ"Moving Gradients: A Path-Based Method for Plausible Image Interpolation"ã¨ã„ã†è«–æ–‡*1ã§ã¯ã€2æžšã®é€£ç¶šã™ã‚‹å…¥åŠ›ç”»åƒã‚’ä¸Žãˆã‚‹ã¨ã€ãã®é–“ã®ãƒ•ãƒ¬ãƒ¼ãƒ ã‚’æ¥µã‚ã¦è‡ªç„¶ã«è£œé–“ç”Ÿæˆã™ã‚‹æ–°ãŸãªæ‰‹æ³•ã‚’ææ¡ˆã—ã¦ã„ã‚‹ã€‚ å›³1 å›³1ã¯ä¸¡ç«¯ã®å…¥åŠ›ç”»åƒA, Bã‹ã‚‰é–“ã®3ãƒ•ãƒ¬ãƒ¼ãƒ ã‚’ç”Ÿæˆã—ãŸä¾‹ã‚’ç¤ºã—ã¦ã„ã‚‹ã€‚ç”Ÿæˆã™ã‚‹è£œé–“ãƒ•ãƒ¬ãƒ¼ãƒ æ•°ã¯ä»»æ„ã§ä½•æžšã§ã‚‚ç”Ÿæˆå¯èƒ½ã§ã‚ã‚Šã€æ¥µã‚ã¦è‡ªç„¶ãªè£œé–“ãŒå®Ÿç¾ã§ãã¦ã„ã‚‹ã€‚ã“ã®ä¾‹ã®é©šãã¹ãã¨ã“ã‚ã¯ã€åˆ¶ç´„æ¡ä»¶ã‚’æœ‰ã™ã‚‹è¤‡é›‘ã§æŸ”ã‚‰ã‹ãªå±€æ‰€å¤‰å½¢ã‚’å«ã‚€è‡ªç„¶ãªè£œé–“ç”»åƒãŒã€å…¨è‡ªå‹•ã§ç”Ÿæˆã•ã‚Œã¦ã„ã‚‹ç‚¹ã§ã‚ã‚‹ã€‚ãƒ¢ãƒ¼ãƒ•ã‚£ãƒ³ã‚°å‡¦ç†ã§ã¯å¯¾å¿œç‚¹ã‚’ä¸€ç‚¹ä¸€ç‚¹æŒ‡å®šã™ã‚‹å¿…è¦ãŒã‚ã‚‹ãŒã€ã“ã“ã§å¿…è¦ãªã®ã¯2ã¤ã®ç”»åƒã‚’é¸æŠžã™ã‚‹ã ã‘ã ã€‚ ç”Ÿæˆã•ã‚Œã‚‹è£œé–“ç”»åƒã®å“è³ªã¯ç´ æ™´ã‚‰ã—ãã€ã¾ãŸã‚¢ã‚¤ãƒ‡ã‚¢ã‚‚ã‚·ãƒ³ãƒ—ãƒ«ã§èˆˆå‘³æ·±ã„ã®ã§ã€åŽŸè«–æ–‡ã‚’å‚ç…§ã—ã¦æœ¬æ‰‹æ³•ã®æ¦‚è¦
y_yanbe 2010/05/20
ã€Œã¨ã‚Šã‚ãˆãšè¨˜éŒ²ã¯å–ã£ã¦ãŠãã¹ãã ã€‚è¨˜éŒ²ã•ãˆã‚ã‚Œã°ãã£ã¨å¾Œã‹ã‚‰ãªã‚“ã¨ã§ã‚‚ã§ãã‚‹ã€‚ã€

algorithm
ãƒªãƒ³ã‚¯
d.y.d. - æœ€çŸæ€§ã‚’ãƒã‚§ãƒƒã‚¯ã™ã‚‹
17:31 10/01/26 è¨€èªžé›‘è«‡ä¼š è¨€èªžé›‘è«‡ä¼š ãªã‚‹ã‚‚ã®ã«è¡Œã£ã¦ãã¾ã—ãŸã€‚ è‡ªåˆ†ã¯ä¸»ã«æœ€è¿‘ã®Dè¨€èªžã®è©±é¡Œ [PDF] [PPTX] ã«ã¤ã„ã¦ã¨ã€ æœ€è¿‘èªã‚“ã Pattern Calculus ãŒã‚¤ãƒžã‚¤ãƒå¿ƒã«éŸ¿ã‹ãªã‹ã£ãŸã¨ã„ã†è©±ã¨ã€ ã“ã‚Œã‚‚æœ€è¿‘èªã‚“ã Prolog ã§ SAT ã‚½ãƒ«ãƒ ã¨ã„ã†è«–æ–‡ãŒæ ¼å¥½è‰¯ã™ãŽã¦å’å€’ã—ãã†ã§ã™ã€ãªã©ã®è©±é¡Œã‚’é›‘è«‡ã—ã¦ã„ã¾ã—ãŸã€‚ SAT ã®è©±ã‚’ã—ã¦ã„ã¦ãµã¨çªç„¶æ°—ã¥ã„ãŸã‚“ã§ã™ãŒã€ç§ãŒä»Šã¾ã§SATã‚½ãƒ«ãƒã«è½ã¨ã—ã¦ã¿ãŸã“ã¨ã®ã‚ã‚‹å•é¡Œã¯ã€ ã™ã¹ã¦å‰²ã¨ç°¡å˜ã« CNFï¼ˆSATã‚½ãƒ«ãƒãŒãã®ã¾ã¾é£Ÿã¹ã¦ãã‚Œã‚‹ç¶ºéº—ãªå½¢å¼ã®è«–ç†å¼ï¼‰ ãŒã§ãã‚ãŒã‚‹å•é¡Œã ã£ãŸã‚ˆã†ã§ã™ã€æ•°ç‹¬ã¨ã‹ã€‚ ä»»æ„ã®å‘½é¡Œè«–ç†å¼ã‚’CNFã«å¤‰æ›ã§ãã‚‹æŒ‡æ•°çˆ†ç™ºã—ãªã„æ–¹æ³•ã‚’ãã†ã„ãˆã°çŸ¥ã‚‰ãªã„ãžä¿ºï¼ã¨ã—ã‚ƒã¹ã£ã¦ãŸã‚‰ soutaro ã•ã‚“ãŒç´ æ™´ã‚‰ã—ã„è§£èª¬ ã‚’ã—ã¦ä¸‹ã•ã„ã¾ã—ãŸã€‚ã‚ã‚ŠãŒãŸã‚„ã€‚ ã‚ã¨ shinhã•ã‚“ã® ã€Œã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿
y_yanbe 2010/01/15
algorithm
ãƒªãƒ³ã‚¯
Pythonã§A*(A-Star)ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ - Pashangoâ€™s Blog
ä»Šå›žã¯A*ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’Pythonã§ã‚„ã£ã¦ã¿ã¾ã™ã€‚ ã‚²ãƒ¼ãƒ ãƒ—ãƒã‚°ãƒ©ãƒžã®é–“ã§ã¯ã€ã‚‚ã¯ã‚„å¸¸è˜ã¨ãªã‚Šã¤ã¤ã‚ã‚‹æœ€çŸçµŒè·¯å•é¡Œè§£æ±ºã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã™ã€‚ A*ã¯ã€å¤å…¸çš„æ‰‹æ³•ã§ã‚ã‚‹ã€Œãƒ€ã‚¤ã‚¯ã‚¹ãƒˆãƒ©æ³•ã€ã‚’æ”¹è‰¯ã—ãŸã‚‚ã®ã§ã™ã€‚ ã‚¹ã‚¿ãƒ¼ãƒˆåœ°ç‚¹ã‹ã‚‰ãƒŽãƒ¼ãƒ‰nã‚’é€šã£ã¦ã‚´ãƒ¼ãƒ«ã«è¾¿ã‚Šä»˜ãã¨ãã€æœ€çŸè·é›¢ã‚’f(n)ã¨ã™ã‚‹ã¨ã€ f(n) = g(n) + h(n) ã¨ã™ã‚‹ã“ã¨ãŒã§ãã¾ã™ã€g(n)ã¯ã€Œã‚¹ã‚¿ãƒ¼ãƒˆã‹ã‚‰ãƒŽãƒ¼ãƒ‰nã¾ã§ã®æœ€çŸè·é›¢ã€ã€h(n)ã¯ã€ŒãƒŽãƒ¼ãƒ‰nã‹ã‚‰ã‚´ãƒ¼ãƒ«ã¾ã§ã®æœ€çŸè·é›¢ã€ã§ã™ã€‚ ã§ã‚‚ã€æœ€åˆã‹ã‚‰é©åˆ‡ãªg(n)ã¨h(n)ãŒåˆ¤ã£ã¦ã‚‹ãªã‚‰è‹¦åŠ´ã—ã¾ã›ã‚“ã‚ˆãã€‚ ã ã‹ã‚‰ã€ãƒ†ã‚ãƒˆãƒ¼ãªäºˆæ¸¬å€¤ã‚’ä½¿ã£ã¦ã€æœ€çŸçµŒè·¯ã‚’ã‚ã‚‹ç¨‹åº¦äºˆæ¸¬ã—ã¦åŠ¹çŽ‡çš„ã«çµŒè·¯æŽ¢ç´¢ã‚’ã—ã¦ã¿ã‚ˆã†ã¨ã„ã†äº‹ã§ã™ã€‚ ãƒ†ã‚ãƒˆãƒ¼ãªäºˆæ¸¬å€¤ã‚’ä½¿ã£ãŸæœ€çŸçµŒè·¯è·é›¢ã‚’f*(n)ã¨ã™ã‚‹ã¨ f*(n) = g*(n) + h*(n) ã¨ãªã‚Šã¾ã™ã€f*(n)ã‚’æ±‚ã‚ã‚‹ãŸã‚ã«ãƒ†ã‚ãƒˆãƒ¼ãªg*(n)ã¨h*(n)ã‚’
y_yanbe 2010/01/15
python

algorithm
ãƒªãƒ³ã‚¯
liris.orgÂ -Â ã“ã®ã‚¦ã‚§ãƒ–ã‚µã‚¤ãƒˆã¯è²©å£²ç”¨ã§ã™ï¼Â -Â liris ãƒªã‚½ãƒ¼ã‚¹ãŠã‚ˆã³æƒ…å ±
This webpage was generated by the domain owner using Sedo Domain Parking. Disclaimer: Sedo maintains no relationship with third party advertisers. Reference to any specific service or trade mark is not controlled by Sedo nor does it constitute or imply its association, endorsement or recommendation.
y_yanbe 2010/01/06
algorithm

p2p
ãƒªãƒ³ã‚¯
Googleæ¤œç´¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ç”Ÿæ…‹ç³»å´©å£Šã‚’äºˆæ¸¬ | WIRED VISION
å‰ã®è¨˜äº‹ã€€ã€Œé£›è¡Œæ©Ÿã‹ã‚‰ãƒ¬ãƒ¼ã‚¶ãƒ¼ã§åœ°ä¸Šæ”»æ’ƒã€å®Ÿé¨“ã«æˆåŠŸ Googleæ¤œç´¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ç”Ÿæ…‹ç³»å´©å£Šã‚’äºˆæ¸¬ 2009å¹´9æœˆ 8æ—¥ Hadley Leggett å†™çœŸï¼šFlickr/fusion68kã€ã‚¤ãƒ©ã‚¹ãƒˆï¼šPLOS Computational Biologyã€‚ã‚µã‚¤ãƒˆãƒˆãƒƒãƒ—ã®ç”»åƒã¯æµ·è—»ã‚’é£Ÿã¹ã‚‹ãƒžãƒŠãƒ†ã‚£ã€‚ç”»åƒã¯Wikimedia Commons ç”Ÿç‰©å¦è€…ãŸã¡ã¯ã€ç”Ÿæ…‹ç³»ã‚’ç ´å£Šã™ã‚‹æœ€ã‚‚åŠ¹çŽ‡çš„ãªæ–¹æ³•ã‚’è¦‹ã„å‡ºã—ãŸâ€•â€•Googleç¤¾ã®æ¤œç´¢ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«åŸºã¥ã„ã¦ã ã€‚ é£Ÿç‰©ç¶²ã®è¦ã«ãªã‚‹ç”Ÿç‰©ç¨®ãŒçµ¶æ»…ã™ã‚‹ã¨ã€ç”Ÿæ…‹ç³»å…¨ä½“ã®å´©å£Šã‚’å¼•ãèµ·ã“ã™å±é™ºæ€§ãŒã‚ã‚‹ã¨ã„ã†ã“ã¨ã¯ã€ä»¥å‰ã‹ã‚‰ç§‘å¦è€…ã®é–“ã§ã¯çŸ¥ã‚‰ã‚Œã¦ã„ãŸã€‚ã ãŒã€ç¨®ã®ç›¸äº’ä½œç”¨ã¯ç„¡æ•°ã¨ã‚‚ã„ãˆã‚‹ã»ã©å˜åœ¨ã™ã‚‹ãŸã‚ã€ã©ã®å‹•ç‰©ã‚„æ¤ç‰©ãŒã„ã¡ã°ã‚“é‡è¦ãªã®ã‹ã‚’æŽ¨æ¸¬ã™ã‚‹ã“ã¨ã¯é›£ã—ã„ã€‚ [ç¾åœ¨ã®ç¾¤é›†ç”Ÿæ…‹å¦ã§ã¯ã€Œé£Ÿç‰©é€£éŽ–ã€ã¨ã„ã†è¨€è‘‰ã‚ˆã‚Šã€é£Ÿç‰©ç¶²ã¨ã„ã†æ¦‚å¿µã®æ–¹ãŒç¾å®Ÿçš„ãªã‚‚ã®ã¨ã—ã¦é‡è¦–ã•ã‚Œã¦ãã¦ã„ã‚‹
y_yanbe 2009/09/11
PageRankã‚’é€†ã«é©ç”¨ã—ãŸã®ãŒé¢ç™½ã„

pagerank

algorithm
ãƒªãƒ³ã‚¯
6.046/18.410 Introduction to Algorithms on MIT
Stellar CMS Information Services & Techno logy W92 . 304 Vassar Street Cambridge . MA . 02139 Get Help FAQ User Guide Contact the Help Desk Request a Stellar site Resources Supported Browsers Certificates Library E-Reserves WebSIS Updates What's new? Subscribe
y_yanbe 2009/08/26
MITã®Googleé¢æŽ¥å¯¾ç–è¬›ç¾© http://courses.csail.mit.edu/iap/interview/index.php ã®å‰æã¨ãªã£ã¦ã„ã‚‹è¬›ç¾©

algorithm
ãƒªãƒ³ã‚¯
ProblemSets/99 Prolog Problems Solutions - Python Wiki
Probl ems 1-6 AndrÃ© Roberge has a zip file with solutions to the first six probl ems, in Crunchy format: First six Probl em 7: Flatten a nested list structure Based on the standard library documentation: from itertools import chain def flatten(listOfLists): return list(chain(*listOfLists))The suggested solution does not work for a list like the following: a_list = [0, 1, [2, 3], 4, 5, [6, 7]]as the a
y_yanbe 2009/08/18
python

programming

algorithm
ãƒªãƒ³ã‚¯
æ¤œç´¢ã¨æŒ¿å…¥ãŒã¨ã‚‚ã«O(1)ã§ã‚ã‚‹ã‚ˆã†ãªHashã‚’ä½œã‚‹ã«ã¯ã‚³ãƒ„ãŒã„ã‚‹
ã¨ã‚Šã‚ãˆãšHashãŒä½•ã§ã‚ã‚‹ã‹ã¨ã‹ã€ã©ã†ã„ã†ä½œã‚Šã«ãªã£ã¦ã„ã‚‹ã‹ã¨ã‹ã€ãã†ã„ã†ã“ã¨ã¯æ—¢çŸ¥ã¨ã™ã‚‹ã€‚ãƒªã‚¹ãƒˆã®é…åˆ—ã£ã¦ã“ã¨ãã€‚â†ã“ã‚Œã§ä½•è¨€ã£ã¦ã‚‹ã‹åˆ†ã‹ã‚‰ãªã„ãŠã¾ãˆã‚‰ã«ã¯ã“ã®æ–‡ç« ã¯ã¡ã‚‡ã£ã¨ã¯ã‚„ã„ã€‚å…ˆã«ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®æ•™ç§‘æ›¸ã‚’èªã‚€ã“ã¨ã‚’ãŠã™ã™ã‚ã€‚ä»¥ä¸‹ã§ã¯Hashã«ç™»éŒ²ã•ã‚Œã‚‹ã‚ãƒ¼ã¨ãƒ‡ãƒ¼ã‚¿ã®ãƒšã‚¢ã®ã“ã¨ã‚’entryã¨å‘¼ã³ã€ãƒªã‚¹ãƒˆã®é…åˆ—ã¨è¨€ã£ãŸã¨ãã®ãƒªã‚¹ãƒˆã®ã»ã†ã‚’binã€é…åˆ—ã®ã»ã†ã‚’bucketã¨å‘¼ã¶ã€‚ã¤ã¾ã‚Šã€
y_yanbe 2009/07/21
algorithm
ãƒªãƒ³ã‚¯
ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨è¨ˆç®—é‡
é‡‘åº«ç ´ã‚Šã¨è¨ˆç®—é‡è†¨å¼µ n æ¡ã®ç•ªå·ã‚’ã‚‚ã¤æš—è¨¼ãƒãƒƒã‚¯ãŒã‚ã‚‹ã¨ã—ã¾ã™ã€‚ 2 æ¡ã§ã‚ã‚Œã° 00 ã€œ 99 ã® 100 å€‹ã®æ£è§£ãŒã‚ã‚‹ã‚ã‘ã§ã€ 0 ç•ªã‹ã‚‰é †ã«å…¥åŠ›ã—ã¦ã„ãè§£ãæ–¹ã§ã¯ã€ æœ€æ‚ªã®å ´åˆã¯ 100 æ‰‹ç›®ã«é–‹ãã¾ã™ã€‚ 99 ãŒæ£è§£ã¨ã¯é™ã‚‰ãªã„ã®ã§ã€å¹³å‡çš„ã«ã¯ã“ã‚Œã‚ˆã‚Šæ—©ãè§£ãçµ‚ã‚ã‚Šã¾ã™ã€‚ 0 ã§ã‚ã‚‹ã¨ãã®ç¢ºçŽ‡ã¯ 1/100 ã§ã€ã“ã®ã¨ãã®æ‰‹æ•°ã¯ 1 æ‰‹ã§ã™ã€‚ 1 ã§ã‚ã‚‹ã¨ãã®ç¢ºçŽ‡ã¯ 1/100 ã§ã€ã“ã®ã¨ãã®æ‰‹æ•°ã¯ 2 æ‰‹ã§ã™ã€‚ 2 ã§ã‚ã‚‹ã¨ãã®ç¢ºçŽ‡ã¯ 1/100 ã§ã€ã“ã®ã¨ãã®æ‰‹æ•°ã¯ 3 æ‰‹ã§ã™ã€‚ 3 ã§ã‚ã‚‹ã¨ãã®ç¢ºçŽ‡ã¯ 1/100 ã§ã€ã“ã®ã¨ãã®æ‰‹æ•°ã¯ 4 æ‰‹ã§ã™ã€‚ : 99 ã§ã‚ã‚‹ã¨ãã®ç¢ºçŽ‡ã¯ 1/100 ã§ã€ã“ã®ã¨ãã®æ‰‹æ•°ã¯ 100 æ‰‹ã§ã™ã€‚ ã¤ã¾ã‚Šã€å¹³å‡æ‰‹æ•°ã¯ ã«ã‚ˆã‚Šã€100 æ‰‹ç›®ã®ç´„åŠåˆ†ã§ã™ã€‚ ã“ã“ã§ã„ã†è§£ãæ–¹ã‚’ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¨ã„ã„ã€ å•é¡Œã‚’è§£ããŸã‚ã®æ‰‹æ•° (ã¦ã‹ãš) ã®ã“ã¨ã‚’è¨ˆ
y_yanbe 2009/06/16
ä¾‹ãŒåˆ†ã‹ã‚Šã‚„ã™ã„ï¼Žã“ã†ã„ã†å…ˆç”Ÿã«æ•™ã‚ã‚ŠãŸã‹ã£ãŸ / via @arcatdmz http://twitter.com/arcatdmz/status/2180343023

algorithm
ãƒªãƒ³ã‚¯
åŒ—æµ·é“ã‚’è½ã¨ã™ã¨ã©ã†è·³ãã‚‹ã®ã‹ï¼Ÿã®è£å´ - ã¦ã£ãç…®ãƒ–ãƒã‚°
asãŠã‹ã’ã•ã¾ã§å¤§å¥½è©•ã® åŒ—æµ·é“ã‚’è½ã¨ã™ã¨ã©ã†è·³ãã‚‹ã®ã‹ï¼Ÿ ã§ã™ãŒã€ã©ã®ã‚ˆã†ã«ä½œã£ãŸã‹ã€è£½ä½œéŽç¨‹ã‚’ç´¹ä»‹ã™ã‚‹ã“ã¨ã«ã—ã¾ã™ã€‚1. åœ°å›³ã®ç´ æã‚’å–ã£ã¦ãã‚‹ã¾ãšã¯åœ°å›³ã®ç´ æãŒå¿…è¦ã§ã™ã€‚ä»¥ä¸‹ã®ã‚µã‚¤ãƒˆã‹ã‚‰æ‹å€Ÿã—ã¾ã—ãŸã€‚ç™½åœ°å›³ã€ä¸–ç•Œåœ°å›³ã€æ—¥æœ¬åœ°å›³ãŒç„¡æ–™pdf ã‚„ eps å½¢å¼ã®åœ°å›³ãƒ‡ãƒ¼ã‚¿ã‚’ç„¡æ–™ã§é…å¸ƒã—ã¦ãã‚Œã¦ã„ã‚‹ã‚ã‚ŠãŒãŸã„ã‚µã‚¤ãƒˆã§ã™ã€‚2. éƒ½é“åºœçœŒã”ã¨ã«åˆ†å‰²ã™ã‚‹ä¸Šè¨˜ã®ç´ æã¯çœŒå¢ƒã‚‚ãƒ™ã‚¯ã‚¿ãƒ¼å½¢å¼ã§æä¾›ã•ã‚Œã¦ã„ã¦å¤§å¤‰ã‚ã‚ŠãŒãŸã‹ã£ãŸã®ã§ã™ãŒã€å³¶ãŒã©ã®éƒ½é“åºœçœŒã«å±žã—ã¦ã„ã‚‹ã‹ã®æƒ…å ±ãŒã‚ã‚Šã¾ã›ã‚“ã§ã—ãŸã€‚ãã“ã§ã€Google Maps ã¨è¦‹æ¯”ã¹ãªãŒã‚‰ã€å³¶ã‚’éƒ½é“åºœçœŒã”ã¨ã«åˆ†é¡žã—ã¦ã„ãã¾ã—ãŸã€‚ç„¡äº‹ã€å…¨ã¦ã®å³¶ã‚’åˆ†é¡žã—çµ‚ã‚ã£ã¦ã€ã“ã‚“ãªæ„Ÿã˜ã«ãªã‚Šã¾ã—ãŸã€‚ã¨ã¦ã‚‚åœ°å‘³ãªä½œæ¥ã§ã—ãŸâ€¦ã€‚3. éƒ½é“åºœçœŒã”ã¨ã« SVG ã§å‡ºåŠ›ã™ã‚‹æ¬¡ã«ã€Illustrator å†…ã§åˆ†é¡žã—ãŸãƒ‡ãƒ¼ã‚¿ã‚’ãƒ—ãƒã‚°ãƒ©ãƒ ã§æ‰±ãˆã‚‹å½¢å¼ã«ã—ãªã‘ã‚Œã°ãªã‚Šã¾ã›ã‚“ã€‚ã“ã“ã§ã¯ XML
y_yanbe 2009/04/22
actionscript

algorithm
ãƒªãƒ³ã‚¯
è©±ã™ã‚ˆã†ã«ãƒ—ãƒã‚°ãƒ©ãƒ ã™ã‚‹Pythonãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ« - ãªã‚“ãŸã‚‰ãƒŽãƒ¼ãƒˆç¬¬ä¸‰æœŸãƒ™ãƒ¼ã‚¿
Pythonã§ãˆã‚‰ããƒãƒƒã‚ãƒƒã‚·ãƒ¥ãªã‚³ãƒ¼ãƒ‰ã‚’æ›¸ãæ•£ã‚‰ã—ã¦éŠã‚“ã 3ã®å€æ•°ã¨3ãŒä»˜ãæ•°å—ã ã‘ã‚¢ãƒ›ã«ãªã‚Šã€5ã®å€æ•°ã ã‘ã‚¬ãƒ«ãƒžã£ã½ããªã‚‹ã‚¹ã‚¯ãƒªãƒ—ãƒˆã«ãƒãƒ£ãƒ¬ãƒ³ã‚¸ - ãªã‚“ãŸã‚‰ãƒŽãƒ¼ãƒˆ ç¬¬äºŒæœŸ ã†ãˆã€ä»–äººã®ã‚¨ãƒƒã‚»ã‚¤ã‚’ãˆã‚‰ãã“ãä¸‹ã‚ã— OOã‚³ãƒ¼ãƒ‰é¤Šæˆã‚®ãƒ–ã‚¹ - rants OOã‚³ãƒ¼ãƒ‰é¤Šæˆã‚®ãƒ–ã‚¹ã¨ã‚„ã‚‰ãŒäººæ°—ã‚‰ã—ã„ã€‚ - ãªã‚“ãŸã‚‰ãƒŽãƒ¼ãƒˆ ç¬¬äºŒæœŸ ã¦ã€ã‚ã‚ŒãªãŒã‚‰ç”Ÿç”£æ€§ã®ãªã„ã‚„ã¤ã ã¨æ€ã†ã®ã§ã€ã“ã“ã¯é€†ã«ã€Pythonãƒãƒ¥ãƒ¼ãƒˆãƒªã‚¢ãƒ«ã‚’ã²ã¨ã¤æ›¸ã„ã¦ã¿ã‚ˆã†ã¨æ€ã„ã¾ã™ã€‚ ã¾ãšæœ€åˆã«ã€ã“ã‚“ãªãƒ—ãƒã‚°ãƒ©ãƒ ãŒã‚ã£ãŸã¨ã•ã€‚ #ç´ æ•°ã®æ•°åˆ—ã‚’è¿”ã™ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ def prime_numbers_until(limit): prime_numbers = [] for n in range(2, limit): divider_found = False # 1ã‚ˆã‚Šå¤§ãããã®æ•°ã‚ˆã‚Šå°ã•ã„ç¯„å›²ã§èª¿ã¹ã‚‹ for m in range(2,
y_yanbe 2009/04/22
æœ€åˆã®ä¾‹ã¿ãŸã„ãªã‚³ãƒ¼ãƒ‰ã‚’æ›¸ã„ã¦ã—ã¾ã„ãŒã¡ãªã®ã§çŸ¯æ£ã—ã‚ˆã†

algorithm

python
ãƒªãƒ³ã‚¯
ã€ã‚¤ãƒ³ãƒ•ã‚©ã‚·ãƒ¼ã‚¯ã€‘Infoseek ï¼š æ¥½å¤©ãŒé‹å–¶ã™ã‚‹ãƒãƒ¼ã‚¿ãƒ«ã‚µã‚¤ãƒˆ
æ—¥é ƒã‚ˆã‚Šæ¥½å¤©ã®ã‚µãƒ¼ãƒ“ã‚¹ã‚’ã”åˆ©ç”¨ã„ãŸã ãã¾ã—ã¦ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã™ã€‚ ã‚µãƒ¼ãƒ“ã‚¹ã‚’ã”åˆ©ç”¨ã„ãŸã ã„ã¦ãŠã‚Šã¾ã™ã¨ã“ã‚å¤§å¤‰ç”³ã—è¨³ã”ã–ã„ã¾ã›ã‚“ãŒã€ç¾åœ¨ã€ç·Šæ€¥ãƒ¡ãƒ³ãƒ†ãƒŠãƒ³ã‚¹ã‚’è¡Œã‚ã›ã¦ã„ãŸã ã„ã¦ãŠã‚Šã¾ã™ã€‚ ãŠå®¢æ§˜ã«ã¯ã€ç·Šæ€¥ã®ãƒ¡ãƒ³ãƒ†ãƒŠãƒ³ã‚¹ã«ã‚ˆã‚Šã€ã”è¿·æƒ‘ã‚’ãŠã‹ã‘ã—ã¦ãŠã‚Šã€èª ã«ç”³ã—è¨³ã”ã–ã„ã¾ã›ã‚“ã€‚ ãƒ¡ãƒ³ãƒ†ãƒŠãƒ³ã‚¹ãŒçµ‚äº†æ¬¡ç¬¬ã€ã‚µãƒ¼ãƒ“ã‚¹ã‚’å¾©æ—§ã„ãŸã—ã¾ã™ã®ã§ã€ ä»Šã—ã°ã‚‰ããŠå¾…ã¡ã„ãŸã ã‘ã¾ã™ã‚ˆã†ã€ãŠé¡˜ã„ç”³ã—ä¸Šã’ã¾ã™ã€‚
y_yanbe 2009/04/16
algorithm

image
ãƒªãƒ³ã‚¯
Local Lucene Geographical Search
by Patrick O'Leary (pjaol at pjaol.com) There are 3 components to how local lucene performs a geographical search. Create a bounding area. Query that areas document set for a text match. Reduce the document set to a precise distance from a center point. Geographical text searching can take multiple formats, inclusion or reductionism. Inclusion is applying text searching over a document set and ver
y_yanbe 2009/04/16
lucene

algorithm

search
ãƒªãƒ³ã‚¯
ã€Œç¢ºçŽ‡ãƒ¢ãƒ‡ãƒ«ã«ã‚ˆã‚‹webãƒ‡ãƒ¼ã‚¿è§£æžæ³•ã€8ç« ãƒ¡ãƒ¢ - <s>gnarl,</s>æŠ€è¡“ãƒ¡ãƒ¢â€â€™<marquee><textarea>ï¿¥
æ˜”æ›¸ã„ãŸã‚„ã¤ã‚’ç™ºæŽ˜ã—ã¦ããŸã€‚ã¾ãŸèªã¿è¿”ã™å¿…è¦ãŒã‚ã‚‹ãªãƒ¼ã€‚ 8ç« ã¯å•†ç”¨ã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³ã®è©±ã€ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ€ã‚·ã‚¹ãƒ†ãƒ ã¨é¡§å®¢è¡Œå‹•è§£æžã€‚ ã“ã“ã§æ‰±ã†ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ€ã‚·ã‚¹ãƒ†ãƒ ã¯ã€ãƒ¦ãƒ¼ã‚¶ã®è¡Œå‹•å±¥æ´ã«åŸºã¥ããƒ¦ãƒ¼ã‚¶ã«å¯¾ã—ã¦ã‚¢ã‚¤ãƒ†ãƒ ã‚’æŽ¨è–¦ã™ã‚‹ã‚ˆã†ãªã‚‚ã®ã€‚ èˆˆå‘³æ·±ã„å•é¡Œã¨ã—ã¦ã€æ¬ æã‚’ã™ã¹ã¦0ã¨è€ƒãˆãŸå ´åˆã€ãƒ¦ãƒ¼ã‚¶iãŒãƒã‚§ãƒƒã‚¯ã—ãªã‹ã£ãŸé …ç›®jã«é–¢ã™ã‚‹è¡Œåˆ—Vä¸ã®æ¬ æåœ°ã®æ‰±ã„ãŒã‚ã‚‹ã€‚ã“ã‚Œã‚‰æ¬ æãƒ‡ãƒ¼ã‚¿ã¯ã€å¿…ãšã—ã‚‚å®Œå…¨ã«ãƒ©ãƒ³ãƒ€ãƒ ã«æ¬ æã—ã¦ã„ã‚‹ã‚ã‘ã§ã¯ãªãã€ãƒ¦ãƒ¼ã‚¶ãŒå¥½ã¾ãªã„é …ç›®ã«å¯¾ã—ã¦ã€Œã©ã¡ã‚‰ã‹ã¨ã„ãˆã°é¸ã°ãªã„ã€ã¨ã„ã†è² ã®ãƒã‚¤ã‚¢ã‚¹ãŒ å½±éŸ¿ã—ã¦ã„ã‚‹ã¨æ€ã‚ã‚Œã‚‹(Breese,J.S.,Heckerman,D. and Kadie,C. 1988 Empirical analysis of predictive algorithms for collaborative filtering.)ã€‚ãƒªã‚³ãƒ¡ãƒ³ãƒ€ã‚·ã‚¹ãƒ†ãƒ ã«é–¢ã™ã‚‹å¤šãã®ç ”ç©¶ã«ãŠã„ã¦ã€
y_yanbe 2009/04/14
recommendation

algorithm
ãƒªãƒ³ã‚¯
ãƒ“ãƒƒãƒˆã‚’æ•°ãˆã‚‹ãƒ»æŽ¢ã™ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
ä½œæˆæ—¥ï¼š2004.05.04 ä¿®æ£æ—¥ï¼š2012.09.01 ã“ã®ãƒšãƒ¼ã‚¸ã¯ 2003å¹´ã®9/11ã€9/28 ã®æ—¥è¨˜ã‚’ã¾ã¨ã‚ã¦ä½œæˆã€‚ ã¯ã˜ã‚ã« PowerPC ç³»ã‚„ Alpha ãªã©ã«ã¯ population count ã¨å‘¼ã°ã‚Œã‚‹ãƒ¬ã‚¸ã‚¹ã‚¿ä¸ã®ç«‹ã£ã¦ã„ã‚‹ãƒ“ãƒƒãƒˆæ•°ã‚’æ•°ãˆã‚‹å‘½ä»¤ãŒå®Ÿè£…ã•ã‚Œã¦ã„ã‚‹ã€‚ é›†åˆæ¼”ç®—ã‚’è¡Œã†ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚’å®Ÿè£…ã—ãŸã„å ´åˆãªã©ã«é‡å®ã—ãã†ãªå‘½ä»¤ã§ã‚ã‚‹ã€‚ è·å ´ã§ã“ã® population count å‘½ä»¤ã«ã¤ã„ã¦è©±ã‚’ã—ã¦ã„ã‚‹ã†ã¡ã«ãƒ“ãƒƒãƒˆã‚«ã‚¦ãƒ³ãƒˆæ“ä½œã‚’ãƒãƒ¼ãƒ‰ã‚¦ã‚§ã‚¢ã§å®Ÿè£…ã™ã‚‹ã®ã¯å¾—ãªã®ã‹ï¼Ÿã¨ã„ã†ç‚¹ãŒè°è«–ã«ãªã£ãŸã€‚ CPU ã®è¨è¨ˆã‚’ã§ãã‚‹ã ã‘ã‚·ãƒ³ãƒ—ãƒ«ã«ã™ã‚‹ãŸã‚ã«ã¯ã€è¤‡é›‘ã§ä½¿ç”¨é »åº¦ã®ä½Žã„å‘½ä»¤ã¯æ¥µåŠ›æ¸›ã‚‰ã—ãŸæ–¹ãŒã‚ˆã„ã€‚ ä¾‹ãˆã° SPARC ã¯å‘½ä»¤ã‚»ãƒƒãƒˆä¸ã«ãƒ“ãƒƒãƒˆã‚«ã‚¦ãƒ³ãƒˆæ¼”ç®—ãŒã‚ã‚‹ãŒã€CPU å†…ã«ã¯å®Ÿè£…ã—ãªã„ã¨ã„ã†æ–¹é‡ã‚’ã¨ã£ã¦ã„ã‚‹(population å‘½ä»¤ã‚’å®Ÿè¡Œã™ã‚‹ã¨ä¸æ£å‘½ä»¤ä¾‹å¤–ãŒç™ºç”Ÿã—ã€ãã‚Œã‚’
y_yanbe 2009/04/09
algorithm
ãƒªãƒ³ã‚¯
ã‚¹ãƒšãƒ«ä¿®æ£ãƒ—ãƒã‚°ãƒ©ãƒ ã¯ã©ã†æ›¸ãã‹
Peter Norvig / é’æœ¨é– è¨³ å…ˆé€±ã€2äººã®å‹äºº(ãƒ‡ã‚£ãƒ¼ãƒ³ã¨ãƒ“ãƒ«)ãŒãã‚Œãžã‚Œåˆ¥å€‹ã«GoogleãŒæ¥µã‚ã¦æ—©ãæ£ç¢ºã«ã‚¹ãƒšãƒ«ä¿®æ£ã§ãã‚‹ã®ã«ã¯é©šãã°ã‹ã‚Šã ã¨ç§ã«è¨€ã£ãŸã€‚ãŸã¨ãˆã° speling ã®ã‚ˆã†ãªèªžã§Googleã‚’æ¤œç´¢ã™ã‚‹ã¨ã€0.1ç§’ãã‚‰ã„ã§ç”ãˆãŒè¿”ã£ã¦ãã¦ã€ã‚‚ã—ã‹ã—ã¦: spelling ã˜ã‚ƒãªã„ã‹ã¨è¨€ã£ã¦ãã‚‹(Yahooã‚„Microsoftã®ã‚‚ã®ã«ã‚‚åŒæ§˜ã®æ©Ÿèƒ½ãŒã‚ã‚‹)ã€‚ãƒ‡ã‚£ãƒ¼ãƒ³ã¨ãƒ“ãƒ«ãŒé«˜ã„å®Ÿç¸¾ã‚’æŒã£ãŸã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã§ã‚ã‚Šæ•°å¦è€…ã§ã‚ã‚‹ã“ã¨ã‚’æ€ãˆã°ã€ã‚¹ãƒšãƒ«ä¿®æ£ã®ã‚ˆã†ãªçµ±è¨ˆçš„è¨€èªžå‡¦ç†ã«ã¤ã„ã¦ã‚‚ã£ã¨çŸ¥ã£ã¦ã„ã¦è‰¯ã•ãã†ãªã‚‚ã®ãªã®ã«ã¨ç§ã¯é©šã„ãŸã€‚ã—ã‹ã—å½¼ã‚‰ã¯çŸ¥ã‚‰ãªã‹ã£ãŸã€‚ã‚ˆãè€ƒãˆã¦ã¿ã‚Œã°ã€ åˆ¥ã«å½¼ã‚‰ãŒçŸ¥ã£ã¦ã„ã‚‹ã¹ãç†ç”±ã¯ãªã„ã®ã ã£ãŸã€‚ é–“é•ã£ã¦ã„ãŸã®ã¯å½¼ã‚‰ã®çŸ¥è˜ã§ã¯ãªãã€ç§ã®ä»®å®šã®æ–¹ã ã€‚ ã“ã®ã“ã¨ã«ã¤ã„ã¦ã¡ã‚ƒã‚“ã¨ã—ãŸèª¬æ˜Žã‚’æ›¸ã„ã¦ãŠã‘ã°ã€å½¼ã‚‰ã°ã‹ã‚Šã§ãªãå¤šãã®äººã«æœ‰ç›Šã‹ã‚‚ã—ã‚Œãªã„ã€‚Googleã®
y_yanbe 2009/03/15
algorithm

programming
ãƒªãƒ³ã‚¯
Link Analysis and Related Topics - Home
2008å¹´åº¦ å…ˆç«¯æƒ…å ±ç§‘å¦ç‰¹è«– II & IV ãƒªãƒ³ã‚¯è§£æžã¨å‘¨è¾ºã®è©±é¡Œ æ‹…å½“ æ–°ä¿ ä» [email protected]aist.jp æ—¥æ™‚ 2008/11/10, 11/17, 12/1, 12/8 (å…¨ 4 å›ž) - 4é™ 15:10-16:40 å ´æ‰€ æƒ…å ±æ£Ÿ L3 è¬›ç¾©å®¤ ãƒªãƒ³ã‚¯è§£æžã¯, ã‚°ãƒ©ãƒ• (ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯) ãƒ‡ãƒ¼ã‚¿ã®æ§‹é€ ã‹ã‚‰æœ‰ç”¨ãªæƒ…å ±ã‚’æŠ½å‡ºã™ã‚‹ãŸã‚ã®, ãƒ‡ãƒ¼ã‚¿ãƒžã‚¤ãƒ‹ãƒ³ã‚°ã®ä¸€ç ”ç©¶åˆ†é‡Žã§ã™. ã“ã®è¬›ç¾©ã§ã¯ã¾ãš, ãƒªãƒ³ã‚¯è§£æžãŒå–ã‚Šæ‰±ã† 2 ç¨®é¡žã®å°ºåº¦ (é‡è¦åº¦ã¨é–¢é€£åº¦) ã«ã¤ã„ã¦è¿°ã¹, ãã‚Œãžã‚Œã®ä»£è¡¨çš„ãªè¨ˆç®—æ‰‹æ³•ã‚’ç´¹ä»‹ã—ã¾ã™. å¾ŒåŠã§ã¯, è¿‘å¹´æ©Ÿæ¢°å¦ç¿’åˆ†é‡Žã§ç››ã‚“ã«ç ”ç©¶ã•ã‚Œã¦ã„ã‚‹ã‚«ãƒ¼ãƒãƒ«ã®ã†ã¡, ã‚°ãƒ©ãƒ•ä¸Šã®ç¯€ç‚¹ã«å¯¾ã—ã¦å®šç¾©ã•ã‚ŒãŸã‚«ãƒ¼ãƒãƒ« (ã‚°ãƒ©ãƒ•ã‚«ãƒ¼ãƒãƒ«) ã¨, ãã®ãƒªãƒ³ã‚¯è§£æžã¸ã®å¿œç”¨ã«ã¤ã„ã¦ç´¹ä»‹ã—ã¾ã™. ç¬¬1å›ž 11æœˆ10æ—¥ ã‚¹ãƒ©ã‚¤ãƒ‰ ç¬¬2å›ž 11æœˆ17æ—¥ ã‚¹ãƒ©ã‚¤ãƒ‰ ç¬¬3å›ž 12æœˆ1æ—¥
y_yanbe 2009/02/27
research

algorithm
ãƒªãƒ³ã‚¯
PyML - machine learning in Python â€” PyML v0.7.3 documentation
PyML - machine learning in PythonÂ¶ PyML is an interactive object oriented framework for machine learning written in Python. PyML focuses on SVMs and other kernel methods. It is supported on Linux and Mac OS X. NewsÂ¶ Added wrapper for liblinear in version 0.7.8. This allows extremely fast training of linear SVMs. FeaturesÂ¶ Classifiers: support vector machines, nearest neighbor, ridge regression Mul
y_yanbe 2009/02/23
python

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