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

yu4u id:yu4u

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

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

Pythonè¨€èªžã«ã‚ˆã‚‹å®Ÿå‹™ã§ä½¿ãˆã‚‹100+ã®æœ€é©åŒ–å•é¡Œ | opt100
ã¯ã˜ã‚ã« æœ¬æ›¸ã¯ï¼Œç†è€…ãŒé•·å¹´æ›¸ãæºœã‚ãŸæ§˜ã€…ãªå®Ÿå‹™çš„ãªæœ€é©åŒ–å•é¡Œã«ã¤ã„ã¦ã¾ã¨ã‚ãŸã‚‚ã®ã§ã‚ã‚‹ï¼Ž æœ¬æ›¸ã¯ï¼ŒJupyter Laboã§è¨˜è¿°ã•ã‚ŒãŸã‚‚ã®ã‚’è‡ªå‹•çš„ã«å¤‰æ›ã—ãŸã‚‚ã®ã§ã‚ã‚Šï¼Œä»¥ä¸‹ã®ã‚µãƒãƒ¼ãƒˆãƒšãƒ¼ã‚¸ã§å…¬é–‹ã—ã¦ã„ã‚‹ï¼Ž ã‚³ãƒ¼ãƒ‰ã‚‚ä¸€éƒ¨å…¬é–‹ã—ã¦ã„ã‚‹ãŒï¼Œã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ã‚’ä¿ç®¡ã—ãŸ Github è‡ªä½“ã¯ãƒ—ãƒ©ã‚¤ãƒ™ãƒ¼ãƒˆã§ã‚ã‚‹ï¼Ž æœ¬ã‚’è³¼å…¥ã—ãŸäººã¯ï¼Œã‚µãƒãƒ¼ãƒˆãƒšãƒ¼ã‚¸ã§å…¬é–‹ã—ã¦ã„ãªã„ãƒ—ãƒã‚°ãƒ©ãƒ ã‚’ åœ§ç¸®ãƒ•ã‚¡ã‚¤ãƒ« ã§ãƒ€ã‚¦ãƒ³ãƒãƒ¼ãƒ‰ã™ã‚‹ã“ã¨ãŒã§ãã‚‹ï¼Ž ãƒ€ã‚¦ãƒ³ãƒãƒ¼ãƒ‰ã—ãŸãƒ•ã‚¡ã‚¤ãƒ«ã®è§£å‡ãƒ‘ã‚¹ãƒ¯ãƒ¼ãƒ‰ã¯<æœ¬ã«è¨˜è¿°>ã§ã‚ã‚‹ï¼Ž ä½œè€…ã®ãƒšãƒ¼ã‚¸ My HP æœ¬æ›¸ã®ã‚µãƒãƒ¼ãƒˆãƒšãƒ¼ã‚¸ Support Page å‡ºç‰ˆç¤¾ã®ãƒšãƒ¼ã‚¸ Pythonã«ã‚ˆã‚‹å®Ÿå‹™ã§å½¹ç«‹ã¤æœ€é©åŒ–å•é¡Œ100+ (1) â€•ã‚°ãƒ©ãƒ•ç†è«–ã¨çµ„åˆã›æœ€é©åŒ–ã¸ã®æ‹›å¾…â€• Pythonã«ã‚ˆã‚‹å®Ÿå‹™ã§å½¹ç«‹ã¤æœ€é©åŒ–å•é¡Œ100+ (2) â€•å‰²å½“ãƒ»æ–½è¨é…ç½®ãƒ»åœ¨åº«æœ€é©åŒ–ãƒ»å·¡å›žã‚»ãƒ¼ãƒ«ã‚¹ãƒžãƒ³â€• Pythonã«ã‚ˆã‚‹å®Ÿå‹™ã§å½¹ç«‹ã¤
yu4u 2021/12/13
æ©Ÿæ¢°å¦ç¿’

algorithm

æœ€é©åŒ–
ãƒªãƒ³ã‚¯
æœ€é©è¼¸é€ã®è§£ãæ–¹
æœ€é©è¼¸é€å•é¡Œï¼ˆWasserstein è·é›¢ï¼‰ã‚’è§£ãæ–¹æ³•ã«ã¤ã„ã¦ã®ã•ã¾ã–ã¾ãªã‚¢ãƒ—ãƒãƒ¼ãƒãƒ»ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ç´¹ä»‹ã—ã¾ã™ã€‚ ç·šå½¢è¨ˆç”»ã‚’ä½¿ã£ãŸå®šå¼åŒ–ã®åŸºç¤Žã‹ã‚‰ã¯ã˜ã‚ã¦ã€ä»¥ä¸‹ã®äº”ã¤ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ç´¹ä»‹ã—ã¾ã™ã€‚ 1. ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã‚·ãƒ³ãƒ—ãƒ¬ãƒƒã‚¯ã‚¹æ³• 2. ãƒãƒ³ã‚¬ãƒªã‚¢ãƒ³æ³• 3. Sinkhorn ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 4. ãƒ‹ãƒ¥ãƒ¼ãƒ©ãƒ«ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã«ã‚ˆã‚‹æŽ¨å®š 5. ã‚¹ãƒ©ã‚¤ã‚¹æ³• ã“ã®ã‚¹ãƒ©ã‚¤ãƒ‰ã¯ç¬¬ä¸‰å›ž 0x-seminar https://sites.google.com/view/uda-0x-seminar/home/0x03 ã§ä½¿ç”¨ã—ãŸã‚‚ã®ã§ã™ã€‚è‡ªå·±å®Œçµã™ã‚‹ã‚ˆã†å¿ƒãŒã‘ãŸã®ã§ã‚»ãƒŸãƒŠãƒ¼ã«å‚åŠ ã—ã¦ã„ãªã„äººã«ã‚‚å½¹ç«‹ã¤ã‚¹ãƒ©ã‚¤ãƒ‰ã«ãªã£ã¦ã„ã¾ã™ã€‚ ã€Žæœ€é©è¼¸é€ã®ç†è«–ã¨ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€å¥½è©•ç™ºå£²ä¸ï¼ https://www.amazon.co.jp/dp/4065305144 Speakerdeck ã«ã‚‚ã‚¢ãƒƒãƒ—ãƒãƒ¼ãƒ‰ã—ã¾ã—ãŸ: https
yu4u 2021/07/01
algorithm

optimization

graph
ãƒªãƒ³ã‚¯
Pythonè¨€èªžã«ã‚ˆã‚‹å®Ÿå‹™ã§ä½¿ãˆã‚‹100+ã®æœ€é©åŒ–å•é¡Œ | opt100
æŒ‡é‡ åŽ³å¯†è§£æ³•ã«å¯¾ã—ã¦ã¯ã€è§£ã‘ã‚‹å•é¡Œä¾‹ã®è¦æ¨¡ã®æŒ‡é‡ã‚’ä¸Žãˆã‚‹ã€‚æ•°ç†æœ€é©åŒ–ã‚½ãƒ«ãƒãƒ¼ã‚’ä½¿ã†å ´åˆã«ã¯ã€Gurobi ã‹mypulpã‚’ç”¨ã„ã€ãã‚Œãžã‚Œã®é™ç•Œã‚’èª¿ã¹ã‚‹ã€‚å‹•çš„æœ€é©åŒ–ã®å ´åˆã«ã¯ã€ãƒ¡ãƒ¢ãƒªã®é™ç•Œã«ã¤ã„ã¦èª¿ã¹ã‚‹ã€‚ è¿‘ä¼¼è§£æ³•ã«å¯¾ã—ã¦ã¯ã€è¿‘ä¼¼èª¤å·®ã®æŒ‡é‡ã‚’ä¸Žãˆã‚‹ã€‚ è¤‡æ•°ã®å®šå¼åŒ–ã‚’ç¤ºã—ã€ã©ã®å®šå¼åŒ–ãŒå®Ÿå‹™çš„ã«è‰¯ã„ã‹ã®æŒ‡é‡ã‚’ç¤ºã™ã€‚ å‡ºæ¥ã‚‹ã ã‘ãƒ™ãƒ³ãƒãƒžãƒ¼ã‚¯å•é¡Œä¾‹ã‚’ç”¨ã„ã‚‹ã€‚OR-Libraryãªã©ã‹ã‚‰å•é¡Œä¾‹ã‚’ãƒ€ã‚¦ãƒ³ãƒãƒ¼ãƒ‰ã—ã€ãƒ‡ã‚£ãƒ¬ã‚¯ãƒˆãƒªã”ã¨ã«ä¿ç®¡ã—ã¦ãŠãã€‚ è§£èª¬ãƒ“ãƒ‡ã‚ªã‚‚Youtubeã§å…¬é–‹ã™ã‚‹ï¼Ž ä¸»è¦ãªå•é¡Œã«å¯¾ã—ã¦ã¯ã‚¢ãƒ—ãƒªã‚’ä½œã£ã¦ãƒ‡ãƒ¢ã‚’ã™ã‚‹ï¼Ž ä»¥ä¸‹ï¼Œãƒ‡ãƒ¢ãƒ“ãƒ‡ã‚ªï¼š æ³¨æ„ åŸºæœ¬çš„ã«ã¯ï¼Œã‚³ãƒ¼ãƒ‰ã‚‚å…¬é–‹ã™ã‚‹ãŒï¼Œ githubè‡ªä½“ã¯ãƒ—ãƒ©ã‚¤ãƒ™ãƒ¼ãƒˆ ãã®ã†ã¡æœ¬ã«ã™ã‚‹ã‹ã‚‚ã—ã‚Œãªã„ï¼ˆäºˆç´„ã¯ã—ã¦ã„ã‚‹ãŒï¼Œ ä¿è¨¼ã¯ãªã„ï¼‰ï¼Ž ãƒ—ãƒã‚¸ã‚§ã‚¯ãƒˆã«å‚åŠ ã—ãŸã„äººã¯ï¼Œä»¥ä¸‹ã®æŠ€é‡ãŒå¿…è¦ï¼ˆgithub, nbdev, poetry, gurobi); ãƒšãƒ¼
yu4u 2021/03/30
æœ€é©åŒ–

æ•°ç†æœ€é©åŒ–

æœ€é©åŒ–å•é¡Œ

algorithm
ãƒªãƒ³ã‚¯
å¤§é‡ã®ãƒ†ã‚ã‚¹ãƒˆã‹ã‚‰ãƒ©ãƒ³ãƒ€ãƒ ã«å°‘æ•°ã®è¡Œã‚’æŠ½å‡ºã—ãŸã„ - Reservoir Sampling - å”¯ç‰©æ˜¯çœŸ @Scaled_Wurm
å‰ã«ä»¥ä¸‹ã®ã‚ˆã†ãªè¨˜äº‹ã‚’æ›¸ãã¾ã—ãŸãŒã€å¤§é‡ã®ãƒ†ã‚ã‚¹ãƒˆã§ã¯ã†ã¾ãã„ã‹ãªã‹ã£ãŸã®ã§æ–°ãŸã«æ›¸ãã¾ã—ãŸ ãƒ•ã‚¡ã‚¤ãƒ«ã‹ã‚‰ãƒ©ãƒ³ãƒ€ãƒ ã«Nè¡Œå–ã‚Šå‡ºã™(shufã‚³ãƒžãƒ³ãƒ‰) - å”¯ç‰©æ˜¯çœŸ @Scaled_Wurm ä¸Šã®è¨˜äº‹ã§ã¯ãƒ†ã‚ã‚¹ãƒˆã‚’ãƒ©ãƒ³ãƒ€ãƒ ã«$k$è¡Œå–ã‚Šå‡ºã—ãŸã„æ™‚"shuf -n k"ã‚³ãƒžãƒ³ãƒ‰ã§ãƒ©ãƒ³ãƒ€ãƒ ã«ã‚·ãƒ£ãƒƒãƒ•ãƒ«ã—ãŸ$k$è¡Œã‚’å–ã‚Šå‡ºã—ã¦ã„ã¾ã—ãŸ ã¨ã“ã‚ãŒéžå¸¸ã«å¤§ããªãƒ†ã‚ã‚¹ãƒˆãƒ•ã‚¡ã‚¤ãƒ«ã«å¯¾ã—ã¦ä¸Šã®ã‚³ãƒžãƒ³ãƒ‰ã‚’å®Ÿè¡Œã™ã‚‹ã¨ã€ä¸€åº¦ã«ãƒ‡ãƒ¼ã‚¿ã‚’å…¨éƒ¨ãƒ¡ãƒ¢ãƒªã«èªã¿è¾¼ã¿å§‹ã‚ã¦ã„ã‚‹ã®ã‹ã€ã™ã”ã„å‹¢ã„ã§ãƒ¡ãƒ¢ãƒªã‚’æ¶ˆè²»ã—ã¦ã„ãã¾ã—ãŸ(sort -Rã§ã‚‚) ãã“ã§ãƒ¡ãƒ¢ãƒªã‚’ã‚ã¾ã‚Šä½¿ã‚ãšã«ãƒ©ãƒ³ãƒ€ãƒ ã«$k$è¡Œå–ã‚Šå‡ºã™æ–¹æ³•ã«ã¤ã„ã¦èª¿ã¹ã¾ã—ãŸ ã¾ãšåŸºæœ¬çš„ãªéžå¾©å…ƒæŠ½å‡ºã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ä»¥ä¸‹ã®è¨˜äº‹ã®ç™ºå±•æ‰‹æ³•ã¨ã‹è¿½è¨˜ã®ã‚ãŸã‚Šã®è©±ãŒã‚ã‹ã‚Šã‚„ã™ã„ã¨æ€ã„ã¾ã™ éžå¾©å…ƒæŠ½å‡ºã®é«˜é€Ÿã‹ã¤å®Ÿè£…ãŒç°¡å˜ãªæ–¹æ³•ã‚’è€ƒãˆã‚‹ - ç¡çœ ä¸è¶³ï¼Ÿï¼ ã“ã®è¨˜äº‹ã®è©±ã‚‚ä¸€åº¦å…¨éƒ¨ã®è¦ç´ ã‚’
yu4u 2018/12/10
å…¨ä½“æ•°ãŒã‚ã‹ã‚‰ãªã„ï¼ˆå…¨éƒ¨èªã‚“ã§ã‹ã‚‰å‡¦ç†ã§ããªã„ï¼‰ã‚±ãƒ¼ã‚¹ã®éžå¾©å…ƒæŠ½å‡ºã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€‚ã“ã†ã„ã†ã®é¢ç™½ã„ãªã

algorithm

sampling algorithm

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

heap
ãƒªãƒ³ã‚¯
algorithm, algorithmic, algorithmicx, algorithm2e, algpseudocode = confused
yu4u 2016/05/24
latex

algorithm

algorithmic

algorithmicx
ãƒªãƒ³ã‚¯
2013å¹´åº¦ã®æ–‡æ³•åœ§ç¸®ã®é€²å±• - Yasuo Tabeiã®æ—¥è¨˜
å¹´ãŒæ˜Žã‘ã¦2014å¹´ã®ï¼‘æœˆã‚‚ã‚‚ã†åŠåˆ†ã¾ã§æ¥ã¦ã—ã¾ã„ã¾ã—ãŸãŒã€èª¿åº¦è‰¯ã„æ™‚æœŸã§ã™ã®ã§, 2013å¹´ã®æŒ¯ã‚Šè¿”ã‚Šè¨˜äº‹ã®ä»£ã‚ã‚Šã«2013å¹´ã®æ–‡æ³•åœ§ç¸®ã®é€²å±•ã‚’æŒ¯ã‚Šè¿”ã£ã¦ã¿ãŸã„ã¨æ€ã„ã¾ã™ã€‚ ã¯ã˜ã‚ã«æ–‡æ³•åœ§ç¸®ã‚’ç°¡å˜ã«ãŠã•ã‚‰ã„ã™ã‚‹ã¨, æ–‡æ³•åœ§ç¸®ã¨ã¯å…¥åŠ›ã¨ãªã‚‹ãƒ†ã‚ã‚¹ãƒˆã®ã¿ã‚’è¡¨ç¾ã™ã‚‹å°ã•ã„CFGã‚’æ§‹ç¯‰ã™ã‚‹åœ§ç¸®æ–¹å¼ã§ã™. ã‚²ãƒŽãƒ é…åˆ—, ãƒãƒ¼ã‚¸ãƒ§ãƒ³ç®¡ç†ã•ã‚ŒãŸãƒ†ã‚ã‚¹ãƒˆ, ãƒªãƒã‚¸ãƒˆãƒªãƒ¼ä¸Šã§ã®ã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ãªã©åå¾©ã™ã‚‹éƒ¨åˆ†åˆ—ã‚’å¤šãå«ã‚€ãƒ†ã‚ã‚¹ãƒˆã«å¯¾ã—ã¦é«˜ã„åœ§ç¸®çŽ‡ã‚’é”æˆã™ã‚‹ã“ã¨ãŒã§ãã¾ã™. ã“ã‚Œã‚‰ã®ãƒ†ã‚ã‚¹ãƒˆã¯åå¾©ãƒ†ã‚ã‚¹ãƒˆã¨å‘¼ã°ã‚Œ, æ¬¡ä¸–ä»£ã‚·ãƒ¼ã‚±ãƒ³ã‚µãƒ¼æŠ€è¡“ã‚„ãƒãƒ¼ã‚¸ãƒ§ãƒ³ç®¡ç†ã‚½ãƒ•ãƒˆã®ç™ºå±•ã«ã‚ˆã‚Šæ–‡æ³•åœ§ç¸®ã¯ä»Šå¾Œã¾ã™ã¾ã™é‡è¦ãªæŠ€è¡“ã¨è¨€ãˆã¾ã™. æ–‡æ³•åœ§ç¸®ã«ã¯ï¼’ã¤ã®å•é¡ŒãŒã‚ã‚Šã¾ã™ã€‚ä¸€ã¤ç›®ã¯å…¥åŠ›ãƒ†ã‚ã‚¹ãƒˆã‚’è¡¨ç¾ã™ã‚‹å°ã•ã„CFGã‚’ã©ã®ã‚ˆã†ã«æ§‹ç¯‰ã™ã‚‹ã‹ã¨ã„ã†å•é¡Œã§ã™ã€‚æœ€å°åŒ–å•é¡Œã¯NP-hardã¨ã—ã¦çŸ¥ã‚‰ã‚Œã¦ã„ã¦, ç¾åœ¨ã¾ã§ã«ã•ã¾ã–ã¾ãªè¿‘ä¼¼ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ
yu4u 2014/01/30
compression

algorithm
ãƒªãƒ³ã‚¯
Large Language Models in Machine Translatio
Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, pp. 858â€“867, Prague, June 2007. c 2007 Association for Computational Linguistics Large Language Models in Machine Translation Thorsten Brants Ashok C. Popat Peng Xu Franz J. Och Jeffrey Dean Google, Inc. 1600 Amphitheatre Parkway Mountain View, CA 94303, USA {br
yu4u 2013/08/15
stupid backoff

google

algorithm

NLP
ãƒªãƒ³ã‚¯
é«˜é€Ÿæ–‡å—åˆ—è§£æžã®"åˆ¥"ä¸–ç•Œ - æ°—ã¾ã¾ãªãƒ–ãƒã‚°
1æœˆã«ã€Œé«˜é€Ÿæ–‡å—åˆ—è§£æžã®ä¸–ç•Œã€ã‚’è³¼å…¥ã—ã¦ã‹ã‚‰åŠå¹´ãŒçµŒã¡ã¾ã—ãŸã€‚ä»¥ä¸‹ã€æ–‡å—åˆ—æœ¬ã¨å‘¼ã³ã¾ã™ã€‚ é«˜é€Ÿæ–‡å—åˆ—è§£æžã®ä¸–ç•Œâ€•â€•ãƒ‡ãƒ¼ã‚¿åœ§ç¸®ãƒ»å…¨æ–‡æ¤œç´¢ãƒ»ãƒ†ã‚ã‚¹ãƒˆãƒžã‚¤ãƒ‹ãƒ³ã‚° (ç¢ºçŽ‡ã¨æƒ…å ±ã®ç§‘å¦) ä½œè€…: å²¡é‡ŽåŽŸå¤§è¼”å‡ºç‰ˆç¤¾/ãƒ¡ãƒ¼ã‚«ãƒ¼: å²©æ³¢æ›¸åº—ç™ºå£²æ—¥: 2012/12/27ãƒ¡ãƒ‡ã‚£ã‚¢: å˜è¡Œæœ¬è³¼å…¥: 15äºº ã‚¯ãƒªãƒƒã‚¯: 324å›žã“ã®å•†å“ã‚’å«ã‚€ãƒ–ãƒã‚° (4ä»¶) ã‚’è¦‹ã‚‹ å…¨æ–‡æ¤œç´¢ã¨ã—ã¦ã€ã€ŒCSAã€ã‚„ã€ŒFM-Indexã€ãŒç´¹ä»‹ã•ã‚Œã¦ã„ã¾ã™ãŒã€ã€Œå…¨æ–‡æ¤œç´¢ã‚·ã‚¹ãƒ†ãƒ ã€ã‚’ä½œã‚‹ã«ã¯ã€ã“ã‚Œã‚‰ã ã‘ã§ã¯ä¸ååˆ†ã§ã™ã€‚ãªãœãªã‚‰ã€ä»¥ä¸‹ã®ã‚ˆã†ãªç‰¹å¾´ãŒã‚ã‚‹ã‹ã‚‰ã§ã™ã€‚ æ–‡æ›¸IDã®è˜åˆ¥ãŒé…ã„ã€‚ å„æ–‡æ›¸IDã«å‡ºç¾ã™ã‚‹é »åº¦ã‚’æ±‚ã‚ã‚‹ã®ãŒé…ã„ã€‚ ã¡ãªã¿ã«ã€è»¢ç½®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹(or N-gramã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹)ã‚’ä½¿ã£ãŸå ´åˆã€ã“ã‚Œã‚‰ã®å‡¦ç†ã¯é«˜é€Ÿã§ã™ãã€‚ ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã‚’åœ§ç¸®ã—ã¦ã„ã‚‹ã®ã ã‹ã‚‰ã—ã‚‡ã†ãŒãªã„ã¨ã‚‚è€ƒãˆã‚‰ã‚Œã¾ã™ãŒã€ä½œã‚ŠãŸã„ã§ã™ã‚ˆãã‡ã€ã€Œå…¨æ–‡æ¤œç´¢ã‚·ã‚¹ãƒ†ãƒ ã€ã€‚ã“
yu4u 2013/07/30
index

nlp

algorithm
ãƒªãƒ³ã‚¯
å…¨ã¦ã®çµ„ã¿åˆã‚ã›ã‚’ä½œã‚‹ã€C++ã€‘ - Programming Magic
C++ã§å…¨ã¦ã®é †åˆ—ã‚’ä½œã‚ŠãŸã‘ã‚Œã°ã€STLã«next_permutationé–¢æ•°ãŒã‚ã‚Šã€ä»¥ä¸‹ã®ã‚ˆã†ã«ç°¡å˜ã«ä½œã‚‹ã“ã¨ãŒã§ãã‚‹ã€‚ #include <iostream> #include <vector> #include <algorithm> int main(){ const int n = 3; std::vector<int> data; // [0, 1, 2, ....]ã¨ã„ã†ã‚µã‚¤ã‚ºnã®é…åˆ—ã‚’ä½œæˆ for(int i=0; i<n; ++i){ data.push_back(i); } // å…¨ã¦ã®é †åˆ—ã‚’å‡ºåŠ› do{ std::cout << "[ " << data[0]; for(unsigned int i=1; i<data.size(); ++i){ std::cout << ", " << data[i]; } std::cout << " ]" << std::end
yu4u 2013/07/17
algorithm

combination

çµ„ã¿åˆã‚ã›
ãƒªãƒ³ã‚¯
Spaghetti Source - å„ç¨®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã® C++ ã«ã‚ˆã‚‹å®Ÿè£…
ACM/ICPCï¼ˆãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚³ãƒ³ãƒ†ã‚¹ãƒˆï¼‰ç³»åˆ—ã®å•é¡Œã‚’è§£ãã“ã¨ã‚’ç›®æ¨™ã«ã—ã¦ï¼Œå„ç¨®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ C++ ã§å®Ÿè£…ã—ã¦ã¿ãŸï¼Žæ¥µã‚ã¦æ„åœ°ãŒæ‚ªã„é¡žã®å•é¡Œã«ã¯å¯¾å¿œã—ã¦ã„ãªã„ã—ï¼Œç‰¹å®šã®å…¥åŠ›ã«å¯¾ã—ã¦é«˜é€Ÿã«å‹•ãã¨ã„ã†ã“ã¨ã‚‚ãªã„ï¼Žè¨ˆç®—é‡ã‚‚æœ€è‰¯ã¨ã¯é™ã‚‰ãªã„ï¼Ž ã“ã‚Œã‚‰ã‚’å‚è€ƒã«ã™ã‚‹æ–¹ã¸ã®æ³¨æ„ã¨ãŠé¡˜ã„ï¼š ã“ã‚Œã‚‰ã®è¨˜è¿°ã¯æ£ç¢ºã¨ã¯é™ã‚Šã¾ã›ã‚“ï¼Žå‚è€ƒæ–‡çŒ®ã‚’å‚ç…§ã™ã‚‹ã“ã¨ã‚’å¼·ãæŽ¨å¥¨ã—ã¾ã™ï¼Žé–“é•ã£ã¦ã„ã‚‹å ´åˆã¯æ˜¯éžæ•™ãˆã¦ãã ã•ã„ï¼Ž ã“ã‚Œã‚‰ã®ãƒ—ãƒã‚°ãƒ©ãƒ ã¯é–“é•ã£ã¦ã„ã‚‹ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ï¼Žå„äººã§æ¤œè¨¼ã™ã‚‹ã“ã¨ã‚’å¼·ãæŽ¨å¥¨ã—ã¾ã™ï¼Žãƒã‚°ãŒã‚ã‚Œã°æ˜¯éžæ•™ãˆã¦ãã ã•ã„ï¼Ž åˆ†é¡žãŒæ€ªã—ã„ã®ã§ï¼Œã“ã‚Œã¯ã“ã£ã¡ã ã‚ã†ï¼Œã¨ã„ã†ã“ã¨ãŒã‚ã‚Œã°ã‚³ãƒ¡ãƒ³ãƒˆã‚’ä¸‹ã•ã‚‹ã¨åŠ©ã‹ã‚Šã¾ã™ï¼Ž æ³¨æ„ï¼ ç¾åœ¨æ›¸ãæ›ãˆä¸ TODO åˆ†é¡žã‚’æ£ã—ãè¡Œã†ï¼Ž å…¨ä½“çš„ã«èª¬æ˜Žã¨ä½¿ã„æ–¹ã‚’è©³ã—ãï¼Ž Verify ã—ã¦ã„ãªã„ã‚‚ã®ã‚’ Verifyï¼Ž ãƒœãƒãƒŽã‚¤å›³ï¼ˆã„ã¤ã«ãªã‚‹ã“ã¨ã‚„ã‚‰â€¦â€¦ï¼‰ åŸºæœ¬ ãƒ†ãƒ³ãƒ—ãƒ¬ãƒ¼ãƒˆ ã‚°ãƒ©ãƒ•
yu4u 2013/04/08
c++

algorithm

programming
ãƒªãƒ³ã‚¯
Floating an algorithm?
I'm typesetting an algorithm using the algorithmx package as follows: \begin{algorithm} \caption{\textsc{Whatever}} \begin{algorithmic}[1] ... \end{algorithm} However, I would like it to float like a figure. If I replace \begin{algorithm} with \begin{figure} it does float as I like, however, the caption does not look as pretty any more (I presume it is redefined by a sig-alternate class I am using
yu4u 2012/06/12
latex

algorithm
ãƒªãƒ³ã‚¯
CRFãŒã‚ˆãã‚ã‹ã‚‰ãªãã¦ãŠè…¹ãŒç—›ããªã£ã¦ã—ã¾ã†äººã®ãŸã‚ã®30åˆ†ã§ã‚ã‹ã‚‹CRFã®ã¯ãªã— - EchizenBlog-Zwei
æ©Ÿæ¢°å¦ç¿’ã®3å¤§æœ‰åæ‰‹æ³•ã¨ã„ãˆã°SVMã€CRFã€LDAã§ã¯ãªã„ã ã‚ã†ã‹(ã¨å‹æ‰‹ã«æ€ã£ã¦ã„ã‚‹)ã€‚ SVM(Support Vector Machine)ã«ã¤ã„ã¦ã¯ä»¥å‰è¨˜äº‹ã‚’æ›¸ã„ãŸã®ã§ä»Šå›žã¯CRF(Conditional Random Fields)ã«ã¤ã„ã¦æ›¸ã„ã¦ã¿ãŸã„ã€‚ æ©Ÿæ¢°å¦ç¿’è¶…å…¥é–€IV ã€œSVM(ã‚µãƒãƒ¼ãƒˆãƒ™ã‚¯ã‚¿ãƒ¼ãƒžã‚·ãƒ³)ã ã£ã¦30åˆ†ã§ä½œã‚Œã¡ã‚ƒã†â˜†ã€œ - EchizenBlog-Zwei ã¨ã„ã£ã¦ã‚‚ä»Šå›žã¯ã•ãã£ã¨èªã‚“ã§ã‚‚ã‚‰ã†ã®ã‚’ç›®çš„ã«ã—ã¦ã„ã‚‹ã®ã§æ‰‹æ³•ã®å…·ä½“çš„ãªè§£èª¬ã¯è¡Œã‚ãªã„ã€‚å…·ä½“çš„ãªéƒ¨åˆ†ã¯@uchumikæ°ã®è³‡æ–™ãŒã¨ã¦ã‚‚è©³ã—ã„ï½¡ uchiumi log: é–“é•ã£ã¦ã‚‹ã‹ã‚‚ã—ã‚Œãªã„CRFã®èª¬æ˜Ž ã¾ãŸã€å®Ÿè£…æ–¹æ³•ã«ã¤ã„ã¦ã¯é«˜æ‘æœ¬(è¨€èªžå‡¦ç†ã®ãŸã‚ã®æ©Ÿæ¢°å¦ç¿’å…¥é–€)ãŒã¨ã¦ã‚‚è©³ã—ã„ã€‚ ã•ã¦ã€å…·ä½“çš„ãªè§£èª¬ã‚’ã—ãªã„ãªã‚‰ä½•ã‚’ã™ã‚‹ã®ï¼Ÿã¨ã„ã†ã“ã¨ã ãŒã€ä»Šå›žã¯ãã‚‚ãã‚‚CRFã¨ã¯ä½•ã‹ã¨ã„ã†è©±ã‚’ã™ã‚‹ã€‚éŽåŽ»ã®çµŒé¨“ä¸Šã“ã®ã€ãã‚‚
yu4u 2011/12/07
crf

algorithm
ãƒªãƒ³ã‚¯
Algorithms by S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani
yu4u 2011/12/01
algorithm

programming

book
ãƒªãƒ³ã‚¯
The Stationary Subspace Analysis Toolbox, MÃ¼ller et al., JMLR 12(Oct):3065âˆ’3069, 2011.
Jan Saputra MÃ¼ller, Paul von BÃ¼nau, Frank C. Meinecke, Franz J. KirÃ¡ly, Klaus-Robert MÃ¼ller; 12(93):3065âˆ’3069, 2011. Abstract The Stationary Subspace Analysis (SSA) algorithm linearly factorizes a high-dimensional time series into stationary and non-stationary components. The SSA Toolbox is a platform-independent efficient stand-alone implementation of the SSA algorithm with a graphical user inter
yu4u 2011/11/14
matlab

toolbox

algorithm

æ©Ÿæ¢°å¦ç¿’
ãƒªãƒ³ã‚¯
algorithmic.sty: LaTeX ãƒ‘ãƒƒã‚±ãƒ¼ã‚¸
>[TeX] >[Package] >[algorithmic.sty]ã€€Version: 2009/08/24 v.0.1 algorithmic.sty (download here) [ãƒ‘ãƒƒã‚±ãƒ¼ã‚¸ã«ã¤ã„ã¦] [ä¸‹ã®ã‚½ãƒ¼ã‚¹ãƒ•ã‚¡ã‚¤ãƒ«] [ä¸Šã®ã‚½ãƒ¼ã‚¹ãƒ•ã‚¡ã‚¤ãƒ«] è©³ã—ãã¯ã€algorithms.pdfã‚’ã”è¦§ãã ã•ã„ã€‚ [ãƒ‘ãƒƒã‚±ãƒ¼ã‚¸ã«ã¤ã„ã¦] algorithmicx.styå‚ç…§ã€‚ algorithm.styã‚’ç”¨ã„ã‚‹ã¨floatç’°å¢ƒã«ã§ãã¾ã™ã€‚ QA: algorithmä¸ã®æ–‡å—ã®å¤§ãã•ã®å¤‰æ›´å‚ç…§ã€‚ To the TeX Page
yu4u 2011/09/30
latex

algorithm
ãƒªãƒ³ã‚¯
ç¬¬1å›žãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨æƒ…å ±æ¤œç´¢ã¨è¨€èªžå‡¦ç†å‹‰å¼·ä¼šã§ç™ºè¡¨ã—ã¦ãã¾ã—ãŸ - è‰ã€…äº
å¤ä¼‘ã¿ã®å®¿é¡Œã¯ã„ã¤ã‚‚ã€æ³£ããªãŒã‚‰8æœˆæœ«ã«å–ã‚Šçµ„ã‚€ã‚¿ã‚¤ãƒ—ã§ã—ãŸã€‚ä»Šã¨ãªã£ã¦ã¯æ‡ã‹ã—ã„ãã®æ°—æŒã¡ã‚’ã¡ã‚‡ã£ã¨æ€ã„å‡ºã—ã¾ã—ãŸã€‚7æœˆ23æ—¥ã«ã€ç¬¬1å›žãƒ‡ãƒ¼ã‚¿æ§‹é€ ã¨æƒ…å ±æ¤œç´¢ã¨è¨€èªžå‡¦ç†å‹‰å¼·ä¼šã«ã¦ã€Œè‡ªç„¶è¨€èªžå‡¦ç†ã«ãŠã‘ã‚‹ argmax æ“ä½œã€ãªã‚‹ã‚¿ã‚¤ãƒˆãƒ«ã§ç™ºè¡¨ã•ã›ã¦ã„ãŸã ãã¾ã—ãŸã€‚ãã®éš›ã«ç”¨ã„ã¾ã—ãŸã‚¹ãƒ©ã‚¤ãƒ‰ã‚’ï¼ˆæ¼¸ãï¼‰å…¬é–‹ã„ãŸã—ã¾ã™ã€‚ Argmax Operations in NLP View more presentations from Hitoshi NISHIKAWA ç·šå½¢è¨ˆç”»å•é¡Œã‚’è§£ãã‚·ãƒ³ãƒ—ãƒ¬ãƒƒã‚¯ã‚¹æ³•ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã«ã¤ã„ã¦åŠ ç†ã—ã¦ã„ã¾ã™ã€‚ã¡ã‚‡ã£ã¨æ™‚é–“ãŒã‹ã‹ã‚ŠéŽãŽã¦ã—ã¾ã„ã¾ã—ãŸãã€‚ A* æŽ¢ç´¢ã«ã¤ã„ã¦ã‚‚åŠ ç†ã—ã‚ˆã†ã¨æ€ã„ã¾ã—ãŸãŒã€ã™ãã«ç¬¬7å›žè‡ªç„¶è¨€èªžå‡¦ç†å‹‰å¼·ä¼šãŒã‚„ã£ã¦å‚ã‚Šã¾ã™ã®ã§ã€æµçŸ³ã«å¤šé‡ã‚¹ãƒ©ã‚¤ãƒ‰å‹™è€…ã¯é¿ã‘ãŸã„ã®ã§å…¬é–‹ã—ã¾ã™ã€‚
yu4u 2011/09/06
nlp

algorithm
ãƒªãƒ³ã‚¯
dag_vector: ãƒ©ãƒ³ãƒ€ãƒ ã‚¢ã‚¯ã‚»ã‚¹å¯èƒ½ãªåœ§ç¸®é…åˆ— - Preferred Networks Research & Development
ã“ã‚“ã«ã¡ã¯ã€ã“ã®å¤ã¯ã‚·ãƒ«ã‚ãƒ¼ãƒ‰ãƒ©ã‚¤ã§ä¹—ã‚Šåˆ‡ã‚ŠãŸã„å²¡é‡ŽåŽŸã§ã™ã€‚ ä»Šæ—¥ã¯æœ€è¿‘å…¬é–‹ã—ãŸC++ã®ã‚ªãƒ¼ãƒ—ãƒ³ã‚½ãƒ¼ã‚¹ã§ã‚ã‚‹dag vectorã«ã¤ã„ã¦ç´¹ä»‹ã—ã¾ã™ã€‚ github: dag_vector ãƒ©ã‚¤ã‚»ãƒ³ã‚¹ã¯ä¿®æ£BSDãƒ©ã‚¤ã‚»ãƒ³ã‚¹ã§ã™ã€‚ dag vector (direct accessible gamma code vector) ã¯å€¤ã‚’åœ§ç¸®ã—ã¦æ ¼ç´ã—ãŸã¾ã¾ä»»æ„ã®å ´æ‰€ã®å€¤ã‚’é«˜é€Ÿã«å‚ç…§å¯èƒ½ãªé…åˆ—ãƒ©ã‚¤ãƒ–ãƒ©ãƒªã§ã™ã€‚ã—ã‹ã‚‚ãƒ‡ãƒ¼ã‚¿æœ«å°¾ã¸ã®è¿½è¨˜ãŒå¯èƒ½ã§ã™ã€‚ dag vectorã¯std::vectorã®ã‚ˆã†ã«åˆ©ç”¨ã§ãã¾ã™ã€‚ä¸‹ã«ã„ãã¤ã‹ä¾‹ã‚’è¦‹ã¦ã„ãã¾ã—ã‚‡ã†ã€‚ dag_vectorã®ä¾‹ #include "dag_vector.hpp" // dag_vectorã¯0ä»¥ä¸Šã®æ£æ•´æ•°ã®é…åˆ—ã‚’æ‰±ã†é…åˆ—ã€‚ dag_vector dv; // å€¤ã¯ã„ã¤ã§ã‚‚è¿½åŠ å¯èƒ½ã€‚è¿½åŠ ã•ã‚ŒãŸå€¤ã¯åœ§ç¸®ã—ã¦æ ¼ç´ã•ã‚Œã‚‹ // æ£æ•´æ•°xã¯2lg(
yu4u 2011/06/26
library

vector

algorithm
ãƒªãƒ³ã‚¯
http://www.leptonica.com/grayscale-morphology.html
yu4u 2011/06/06
é«˜é€Ÿãªå›ºå®šã‚¦ã‚£ãƒ³ãƒ‰ã‚¦ã‚µã‚¤ã‚ºã«å¯¾ã™ã‚‹Minã¾ãŸã¯Max Valueã‚’æ±‚ã‚ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ

min

max

algorithm
ãƒªãƒ³ã‚¯
é«˜é€Ÿã‹ã¤çœãƒ¡ãƒ¢ãƒªã§æ–‡å—åˆ—ã‚’æ‰±ã†ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã€Œ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++ã®
yu4u 2011/05/30
c++

algorithm

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