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

flower_room id:flower_room

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

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

CS231n Convolutional Neural Networks for Visual Recognition
Table of Contents: Architecture Overview ConvNet Layers Convolutional Layer Pooling Layer Normalization Layer Fully-Connected Layer Converting Fully-Connected Layers to Convolutional Layers ConvNet Architectures Layer Patterns Layer Sizing Patterns Case Studies (LeNet / AlexNet / ZFNet / GoogLe Net / VGGNet) Computational Considerations Additional References Convolutional Neural Networks (CNNs / Co
flower_room 2015/10/30
computer

algorithm

machinelearning

programming
ãƒªãƒ³ã‚¯
æ›¸ç±ç·¨é›†å±€ãƒ–ãƒã‚°ï½œOhmsha
2æœˆ15æ—¥(æœ¨)ã«é–‹å‚¬ã•ã‚ŒãŸã€ŒDevelopers Summit 2018(ãƒ‡ãƒ–ã‚µãƒŸ)ã€ï¼ˆä¸»å‚¬ï¼šç¿”æ³³ç¤¾ï¼‰ã«ã¦ã€ŒIT ã‚¨ãƒ³ã‚¸ãƒ‹ã‚¢ã«èªã‚“ã§ã»ã—ã„ï¼ æŠ€è¡“æ›¸ãƒ»ãƒ“ã‚¸ãƒã‚¹æ›¸å¤§è³ž2018ã€ã®ãƒ—ãƒ¬ã‚¼ãƒ³å¤§ä¼šã¨æŠ•ç¥¨ãŒè¡Œã‚ã‚Œã€å¤§é–¢çœŸä¹‹å…ˆç”Ÿã®è‘—æ›¸ã€Žæ©Ÿæ¢°å¦ç¿’å…¥é–€ ãƒœãƒ«ãƒ„ãƒžãƒ³æ©Ÿæ¢°å¦ç¿’ã‹ã‚‰æ·±å±¤å¦ç¿’ã¾ã§ã€ãŒã¿ã”ã¨æŠ€è¡“æ›¸éƒ¨é–€ã®å¤§è³žã®æ „å† ã«è¼ãã¾ã—ãŸï¼ ãƒ—ãƒ¬ã‚¼ãƒ³å¤§ä¼šã§ã¯å¤§é–¢å…ˆç”Ÿè‡ªã‚‰æœ¬æ›¸ã«é–¢ã™ã‚‹ç†±ã„ç†±ã„æ€ã„ã‚’æŠ«éœ²ã—ã¦ã„ãŸã ã¾ã—ãŸã€‚ã“ã®ãƒ—ãƒ¬ã‚¼ãƒ³ã«ã‚ˆã£ã¦ã€Œèªã‚“ã§ã¿ãŸã„ï¼ã€ã€Œæ•°å¼ãŒè‹¦æ‰‹ã ã‘ã©ã“ã®æœ¬ãªã‚‰èªã‚ã‚‹ï¼ã€ã¨æƒ¹ãã¤ã‘ã‚‰ã‚Œã‚‹ã‚ªãƒ¼ãƒ‡ã‚£ã‚¨ãƒ³ã‚¹ãŒç¶šå‡ºï¼ã¿ã”ã¨å¤§è³žã«é¸ã°ã‚Œã‚‹ã“ã¨ã¨ãªã‚Šã¾ã—ãŸã€‚ãƒ–ãƒ©ãƒœãƒ¼ï¼ æœ¬æ›¸ã¯ã€ãŠã¨ãŽè©±ã®ç™½é›ªå§«ã«ç™»å ´ã™ã‚‹ãŠå¦ƒæ§˜ã¨é¡ã®é–¢ä¿‚ã‚’ãªãžã‚‰ãˆã€ãã®å•ç”ã«ã‚ˆã‚Šã€Œæ©Ÿæ¢°å¦ç¿’ã¨ã¯ä½•ã‹ã€ã€Œä½•ãŒã§ãã‚‹ã®ã‹ã€ã‚’æ¥½ã—ã„ã‚¹ãƒˆãƒ¼ãƒªãƒ¼ã¨å¯æ„›ã‚‰ã—ãã—ã‹ã‚‚çš„ç¢ºãªã‚¤ãƒ©ã‚¹ãƒˆã€ãã—ã¦æ•°å¼ã‚’ã¾ã£ãŸãç”¨ã„ã‚‹ã“ã¨ãªãè§£èª¬ã—ã¦ã„ã‚‹ç”»æœŸçš„ãªå†…å®¹ã§ã™ã€‚ ç™»å ´ã™ã‚‹
flower_room 2014/11/05
programming

æœ¬

book

algorithm

æ•°å¦
ãƒªãƒ³ã‚¯
Python ã«ã‚ˆã‚‹æ—¥æœ¬èªžè‡ªç„¶è¨€èªžå‡¦ç†
ã¯ã˜ã‚ã« ã“ã®æ–‡æ›¸ã¯ã€ Steven Bird, Ewan Klein, Edward Loper è‘— è©åŽŸ æ£äººã€ä¸å±± æ•¬åºƒã€æ°´é‡Ž è²´æ˜Žã€€è¨³ ã€Žå…¥é–€ è‡ªç„¶è¨€èªžå‡¦ç†ã€ O'Reilly Japan, 2010. ã®ç¬¬12ç« ã€ŒPython ã«ã‚ˆã‚‹æ—¥æœ¬èªžè‡ªç„¶è¨€èªžå‡¦ç†ã€ã‚’ã€åŽŸæ›¸ Natural Language Processing with Python ã¨åŒã˜ Creative Commons Attribution Noncommercial No Derivative Works 3.0 US License ã®ä¸‹ã§å…¬é–‹ã™ã‚‹ã‚‚ã®ã§ã™ã€‚ åŽŸæ›¸ã§ã¯ä¸»ã«è‹±èªžã‚’å¯¾è±¡ã¨ã—ãŸè‡ªç„¶è¨€èªžå‡¦ç†ã‚’å–ã‚Šæ‰±ã£ã¦ã„ã¾ã™ã€‚å†…å®¹ã‚„è€ƒãˆæ–¹ã®å¤šãã¯è¨€èªžã«ä¾å˜ã—ãªã„ã‚‚ã®ã§ã¯ã‚ã‚Šã¾ã™ãŒã€å˜èªžã®åˆ†ã‹ã¡æ›¸ãã‚’ã—ãªã„ç‚¹ã‚„çµ±èªžæ§‹é€ ç‰ã®é•ã„ã‹ã‚‰ã€æ—¥æœ¬èªžã‚’å¯¾è±¡ã¨ã™ã‚‹å ´åˆã€ã„ãã¤ã‹æ°—ã‚’ã¤ã‘ãªã‘ã‚Œã°ã„ã‘ãªã„ç‚¹ãŒã‚ã‚Šã¾ã™ã€‚æ—¥æœ¬èªžã‚’æ‰±ã†å ´åˆã«ã‚‚
flower_room 2014/11/03
programming

algorithm
ãƒªãƒ³ã‚¯
ãƒžãƒ«ã‚³ãƒ•é€£éŽ–ã§æ—¥æœ¬èªžã‚’ã‚‚ã£ã¨ã‚‚ã‚‰ã—ãè¦ç´„ã™ã‚‹ - ã‚¶ãƒªã‚¬ãƒ‹ãŒè¦‹ã¦ã„ãŸ...ã€‚
ãã‚‚ãã‚‚ã€ãƒžãƒ«ã‚³ãƒ•é€£éŽ–ã¨ã¯ä½•ãªã®ã‹ï¼Ÿå…¨ãèžã„ãŸã“ã¨ã‚‚ãªã‹ã£ãŸã€‚ãã—ã¦ã€æ–‡ç« ã‚’è¦ç´„ã™ã‚‹ã®ã¯ã¨ã£ã¦ã‚‚é«˜åº¦ãªã“ã¨ã ã¨æ€ã£ã¦ã„ã¦ã€è‡ªåˆ†ã®ãƒ¬ãƒ™ãƒ«ã§ã¯ãã®æ–¹æ³•ã‚’ã€ä»Šã¾ã§æ€ã„ä»˜ãã‚‚ã—ãªã‹ã£ãŸã€‚ ã—ã‹ã—ã€ä»¥ä¸‹ã®ã‚ˆã†ãªã‚·ãƒ³ãƒ—ãƒ«ãªRubyã‚³ãƒ¼ãƒ‰ã§ãã‚ŒãŒå‡ºæ¥ã¦ã—ã¾ã†ã¨çŸ¥ã£ãŸæ™‚ã€ç›®ã‹ã‚‰é±—ã§ã‚ã‚‹...ã€‚ä¸€ä½“ã€ä½•ãŒã©ã†ãªã£ã¦ã„ã‚‹ã®ã ï¼Ÿã‚³ãƒ¼ãƒ‰ã‚’è¿½ã„ãªãŒã‚‰ã€ãƒžãƒ«ã‚³ãƒ•é€£éŽ–ã‚’åˆ©ç”¨ã™ã‚‹ã¨ã„ã†ç™ºæƒ³ã®ç´ æ™´ã‚‰ã—ã•ã‚’çŸ¥ã£ãŸï¼ ä½œæ¥ç’°å¢ƒ MacBook OSX 10.5.7 ruby 1.8.6 (2008-08-11 patchlevel 287) [universal-darwin9.0] mecab utf8ç’°å¢ƒã§ã‚¤ãƒ³ã‚¹ãƒˆãƒ¼ãƒ«æ¸ˆã¿ ãƒžãƒ«ã‚³ãƒ•é€£éŽ–ã«å‡ºé€¢ã† rssã‚’æµã—èªã¿ã—ã¦ã„ã‚‹ã¨ã€ä»¥ä¸‹ã®æ—¥è¨˜ã«ç›®ãŒæ¢ã¾ã£ãŸã€‚ï¼ˆç´ æ™´ã‚‰ã—ã„æƒ…å ±ã«æ„Ÿè¬ã§ã™ï¼ï¼‰ MeCabã‚’ä½¿ã£ã¦ãƒžãƒ«ã‚³ãƒ•é€£éŽ– ä¸€ä½“ä½•ãŒå‡ºæ¥ã‚‹ã‚³ãƒ¼ãƒ‰ãªã®ã‹ã€æ—¥è¨˜ã‚’èªã‚“ã ã ã‘ã§ã¯ãƒ”ãƒ³ã¨æ¥ãªã‹ã£
flower_room 2013/09/02
programming

algorithm
ãƒªãƒ³ã‚¯
next generation video: Introducing Daala
aala is a new general-purpose video codec currently under development at Xiph.Org. Our performance target is roughly a generation beyond current 'next-generation' codecs like VP9 and HEVC, making Daala a next-next-generation effort. As with other Xiph codecs, the Daala format is and will always be royalty-free with a permissive FOSS license. On May 30th 2013, our in-development Daala prototype enc
flower_room 2013/06/25
ã‚³ãƒ¼ãƒ‡ãƒƒã‚¯ã®æ¦‚è¦ãŒã‚ã‹ã£ã¦å‚è€ƒã«ãªã‚‹ã€‚

algorithm

programming

codec
ãƒªãƒ³ã‚¯
de Bruijn Graph ã‚’ä½¿ã£ãŸ de novo ã‚¢ã‚»ãƒ³ãƒ–ãƒªã®ç™ºæƒ³ãŒã™ã”ã„ä»¶ - ã»ããç¬‘ã‚€
Velvet ã‚„ ABySS ãªã©ã®ä»£è¡¨çš„ãª de novo ã‚¢ã‚»ãƒ³ãƒ–ãƒªãƒ„ãƒ¼ãƒ«ã§ã¯ã€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã« de Bruijn Graph ã¨ã„ã†ã®ã‚’ä½¿ã£ã¦ã„ã‚‹ãã†ã§ã™ã€‚ã©ã†ã‚„ã£ã¦ã‚¢ã‚»ãƒ³ãƒ–ãƒ«ã—ã¦ã„ã‚‹ã‚“ã ã‚ã†ï¼Ÿã¨èˆˆå‘³ã‚’æŒã£ã¦ã„ãŸã®ã§ã€å…ƒãƒã‚¿ã® An Eulerian path approach to DNA fragment assem bly ã‚’èªã‚“ã§ã¿ãŸã‚“ã§ã™ãŒã€ãã®ç™ºæƒ³ã®ã™ã”ã•ã«åº¦è‚ã‚’æŠœã‹ã‚Œã¾ã—ãŸã€‚ã›ã£ã‹ããªã®ã§ã€ã“ã“ã§ç°¡å˜ã«èª¬æ˜Žã—ã¦ã¿ãŸã„ã¨æ€ã„ã¾ã™ã€‚ ã‚±ãƒ¼ãƒ‹ãƒ’ã‚¹ãƒ™ãƒ«ã‚¯ã®æ©‹ ã¾ãšã¯ã‚°ãƒ©ãƒ•ç†è«–ã®èª¬æ˜Žã‹ã‚‰ã€‚ã‚°ãƒ©ãƒ•ç†è«–ã¯ã€18ä¸–ç´€ã«ã‚ªã‚¤ãƒ©ãƒ¼ã¨ã„ã†æ•°å¦è€…ãŒã€Œã‚±ãƒ¼ãƒ‹ãƒ’ã‚¹ãƒ™ãƒ«ã‚¯ã®æ©‹ã€ã¨ã„ã†å•é¡Œã‚’è§£ããŸã‚ã«è€ƒãˆå‡ºã—ãŸã¨ã„ã‚ã‚Œã¦ã„ã¾ã™ã€‚ ã€Œã‚±ãƒ¼ãƒ‹ãƒ’ã‚¹ãƒ™ãƒ«ã‚¯ã®æ©‹ã€ã¯ã€æ¬¡ã®ã‚ˆã†ãªå•é¡Œã§ã™ã€‚ 18ä¸–ç´€ã®åˆã‚ã”ã‚ã«ãƒ—ãƒã‚¤ã‚»ãƒ³çŽ‹å›½ã®é¦–éƒ½ã§ã‚ã‚‹ã‚±ãƒ¼ãƒ‹ãƒ’ã‚¹ãƒ™ãƒ«ã‚¯ã¨ã„ã†å¤§ããªç”ºãŒã‚ã£ãŸã€‚ã“ã®ç”ºã®ä¸å¤®ã«ã¯ã€ãƒ—ãƒ¬ãƒ¼ã‚²ãƒ«å·ã¨ã„ã†å¤§ã
flower_room 2012/05/07
algorithm

programming

graph
ãƒªãƒ³ã‚¯
MapReduceã®ãƒ‘ã‚¿ãƒ¼ãƒ³ã€ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€ãã—ã¦ãƒ¦ãƒ¼ã‚¹ã‚±ãƒ¼ã‚¹ - ãã—ã ã®Hatena
Ilya Katsovæ°ã«ã‚ˆã‚‹ã€ŒMapReduce Patterns, Algorithms, and Use Casesã€ã®ç¿»è¨³ http://highlyscala ble.wordpress.com/2012/02/01/mapreduce-patterns/ (ä¸‹æ›¸ãã«å…¥ã‚Œã¦æŽ¨æ•²ã™ã‚‹ã¤ã‚‚ã‚ŠãŒã€ãªã‚“ã‹å…¬é–‹ã•ã‚Œã¦ã—ã¾ã£ã¦ã„ãŸã®ã§ã€ã‚ã¨ã§ã„ã‚ã„ã‚ä¿®æ£ã™ã‚‹ã¨æ€ã„ã¾ã™) February 1, 2012 ã“ã®è¨˜äº‹ã§ã¯ã€Webã‚„ç§‘å¦è«–æ–‡ã§è¦‹ã‚‰ã‚Œã‚‹ç•°ãªã‚‹ãƒ†ã‚¯ãƒ‹ãƒƒã‚¯ã®ä½“ç³»çš„ãªè¦–ç‚¹ã‚’ä¸Žãˆã‚‹ãŸã‚ã«ã€æ•°ã€…ã®MapReduceãƒ‘ã‚¿ãƒ¼ãƒ³ã¨ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ã¾ã¨ã‚ãŸã€‚ ã„ãã¤ã‹ã®å®Ÿç”¨çš„ãªã‚±ãƒ¼ã‚¹ã‚¹ã‚¿ãƒ‡ã‚£ã‚‚æä¾›ã—ã¦ã„ã‚‹ã€‚ ã™ã¹ã¦ã®èª¬æ˜Žã¨ã‚³ãƒ¼ãƒ‰ã‚¹ãƒ‹ãƒšãƒƒãƒˆã§ã¯ã€Mapperã€Reducerã€Combinerã€Partitionaerã€ã‚½ãƒ¼ãƒ†ã‚£ãƒ³ã‚°ã«ãŠã„ã¦Hadoopã®æ¨™æº–çš„ãªMapReduceãƒ¢ãƒ‡ãƒ«ã‚’åˆ©ç”¨ã—ã¾ã™ã€‚ã“ã®ãƒ•ãƒ¬ãƒ¼
flower_room 2012/03/01
programming

algorithm

hadoop

mapreduce
ãƒªãƒ³ã‚¯
é »å‡ºå…¸åž‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®æ¼”ç¿’å•é¡Œã¨ã—ã¦ã‚ˆã•ã’ãªã‚„ã¤ - kyuridenamidaã®ãƒãƒ©è£
åŠ¹çŽ‡çš„ãªåˆ¥è§£ã¨ã‹å˜åœ¨ã™ã‚‹å•é¡Œã‚‚ã‚ã‚‹ã‘ã©æ¼”ç¿’ã«ã‚ˆã•ãã†ãªã‚„ã¤ã‚’ãƒ”ãƒƒã‚¯ã‚¢ãƒƒãƒ—ã€‚ãã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã˜ã‚ƒãªã„ã¨è§£ã‘ãªã„ã‚ã‘ã§ã¯ãªã„ã£ã¦å•é¡Œã‚‚å¤šã„ã®ã§æ³¨æ„ã€‚(ãŸã æ¼”ç¿’ã™ã‚‹ã®ã«ã¯éƒ½åˆãŒè‰¯ã„ã‹ãªã¨)â€»å€‹äººçš„é›£æ˜“åº¦ã‚’ã¤ã‘ã¦ã¿ã¾ã—ãŸã€‚ã¨ã¦ã‚‚ä¸»è¦³çš„ãªé›£æ˜“åº¦ä»˜ã‘ãªã®ã§æ°—ã«ã›ãšè§£ã„ã¦ã¿ã¦ãã ã•ã„ã€‚æ·±ã•å„ªå…ˆæŽ¢ç´¢ãƒ»Balls[â˜†]ãƒ»Sum of Integers[â˜†]ãƒ»The Number of Island[â˜†]ãƒ»Block[â˜…]å¹…å„ªå…ˆæŽ¢ç´¢ãƒ»Mysterious Worm[â˜…]ãƒ»Cheese[â˜…]ãƒ»Seven Puzzle[â˜…â˜†]ãƒ»Stray Twins[â˜…â˜…]ãƒ»Deven-Eleven[â˜…â˜…]ãƒ»Summer of Phyonkichi[â˜…â˜…â˜†]ãƒ¯ãƒ¼ã‚·ãƒ£ãƒ«ãƒ•ãƒã‚¤ãƒ‰æ³•(For å…¨ç‚¹å¯¾æœ€çŸè·¯å•é¡Œ)ãƒ»Traveling Alone: One-way Ticket of Youth[â˜…]ãƒ»A reward for a Car
flower_room 2011/10/09
programming

algorithm
ãƒªãƒ³ã‚¯
Diff
Diff - Download as a PDF or view online for free
flower_room 2010/06/02
è¦ªåˆ‡ãªDiffã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®è§£èª¬ã€‚

programming

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

algorithm
ãƒªãƒ³ã‚¯
BlockSorting
BlockSortingã¯ã€ä»Šã¾ã§ã®ãƒ‡ãƒ¼ã‚¿åœ§ç¸®ã§æœ‰åãªæ–¹æ³•ã§ã‚ã‚‹LZæ³•ã¨ã¯å…¨ãé•ã†ã€ãƒ¦ãƒ‹ãƒ¼ã‚¯ãªæ“ä½œã‚’ç”¨ ã„ã¦ãƒ‡ãƒ¼ã‚¿ã‚’åœ§ç¸®ã™ã‚‹æ–¹æ³•ã§ã‚ã‚Šã€M.Burrowsã•ã‚“ã¨D.J.Wheelerã•ã‚“ãŒä½œè€…ãªã®ã§ã€ŒBWTransf ormã€ ã¨ã‚‚ã„ã„ã¾ã™ã€‚ ã“ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã¯ç°¡å˜ã«è¨€ã£ã¦ã—ã¾ãˆã°ã€ã€Œãƒ‡ãƒ¼ã‚¿ã‚’ãã‚‹ãã‚‹å›žã—ã¦ã‚½ãƒ¼ãƒˆã—ã¦å‡ºåŠ›ã€ã¨ã„ã†ã‚‚ ã®ã§ã™ã€‚ç°¡å˜ã™ãŽã‚‹ã‹ã‚‚ã—ã¾ã„ã¾ã›ã‚“ãŒã€æœ¬å½“ã«ãã†ãªã‚“ã§ã™ã€‚ ã¡ãªã¿ã«ã€ã“ã®BlockSortingã€å˜ä½“ã§ã¯å…¨ãåœ§ç¸®ã—ã¾ã›ã‚“ã€‚ãŸã å¯é€†ãªå½¢ã«ãƒ‡ãƒ¼ã‚¿ã‚’å¤‰æ›ã™ã‚‹ã¨ ã„ã†ã‚‚ã®ã§ã™ã€‚ã—ã‹ã—ã€BlockSortingå¾Œã®ãƒ‡ãƒ¼ã‚¿ã¯éžå¸¸ã«åœ§ç¸®ã•ã‚Œã‚„ã™ã„çŠ¶æ…‹ã«ãªã‚Šã¾ã™ã€‚ä¾‹ãˆã‚‹ ã¨ã€è‰²ã€…ãªå½¢ã‚’ã—ãŸã‚¹ãƒãƒ³ã‚¸ï¼ˆãƒ‡ãƒ¼ã‚¿ï¼‰ãŒç®±ã«ã”ã¡ã‚ƒã”ã¡ã‚ƒã«å…¥ã£ã¦å±±ç©ã¿ã«ãªã£ã¦ã„ã‚‹ã¨ã—ã¾ã™ ã€‚ã€€ã“ã‚Œã‚’ãã®ã¾ã¾ä¸Šã‹ã‚‰ã‚®ãƒ¥ãƒ¼ã£ã¨æŠ¼ã—ã¤ã¶ã™ã®ãŒLZæ³•ã‚„Huffmanæ³•ãªã®ã«å¯¾ã—ã€ä¸€åº¦ã€å½¢ãŒä¼¼ãŸ ã‚‚
flower_room 2006/10/07
programming

algorithm
ãƒªãƒ³ã‚¯
1