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

hrstt id:hrstt

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

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

ã‚°ãƒ©ãƒ•ã‚’åˆ‡ã‚‹ - itaâ€™s diary
ã€Œæœ€é«˜ã®ã‚«ãƒ¬ãƒ¼ã‚’ä½œã‚Œã€å•é¡Œ https://codeiq.jp/ace/yuki_hiroshi/q210 é¢ç™½ã„ã§ã™ã€‚åˆ¥ã®ä¾‹ã«ä¾‹ãˆã‚‹ã¨ã€128äººã®é›†å›£ã‚’ï¼’ã¤ã®çµ„ã«åˆ†ã‘ã¾ã™ã€‚ä»²ã®ã„ã„ãƒšã‚¢ã¯ã€ãªã‚‹ã¹ãåŒã˜çµ„ã«ãªã‚‹ã‚ˆã†ã«ã—ãŸã„ã€ã¨ã„ã†å•é¡Œã€‚ 128å€‹ã®ç²’åã‚’ç”¨æ„ã—ã¦ã€ä»²ã®ã„ã„åŒå£«ãŒå¼•ãåˆã„ã€ãã‚Œä»¥å¤–ã¯åç™ºã™ã‚‹ã‚ˆã†ã«ã—ã¦å‹•ã‹ã™ã¨ä»¥ä¸‹ã®ã‚ˆã†ã«ãªã‚Šã¾ã—ãŸã€‚ ãªã‚“ã¨ãã†ã„ã†è¨å•ã§ã—ãŸã‹ã€‚é›†å›£ã‚’äºŒã¤ã«åˆ‡ã‚‹ãªã‚‰ã€å·¦ã®å¤ªç·šã§åˆ‡ã‚Œã°11çµ„ã®å¥½ãåŒå£«ã‚’åˆ†æ–ã™ã‚‹ã ã‘ã§æ¸ˆã¿ã¾ã™ã€‚ã“ã‚ŒãŒãŠãã‚‰ãæœ€é©è§£ã€‚å³ãŒ12æœ¬ã§ã‚ãšã‹ã«é•ã†ã¨ã“ã‚ãŒçµ¶å¦™ã€‚ ç¢ºå®Ÿã«æœ€é©è§£ã‚’æ±‚ã‚ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚‚ã€è¤‡é›‘ã ã‘ã©ã‚ã‚Šã¾ã™ã€‚ä»¥å‰ã®è‡ªåˆ†ã®æ—¥è¨˜ã‹ã‚‰å¼•ç”¨ æœ€å¤§æµ/æœ€å°åˆ‡æ–å®šç† ãŸã¨ãˆã°æ±äº¬éƒ½å†…ã‹ã‚‰ç‘æ³¢ã«äººãŒä¸€æ–‰ã«ç§»å‹•ã™ã‚‹ã¨ã„ã†ã‚·ãƒãƒ¥ã‚¨ãƒ¼ã‚·ãƒ§ãƒ³ã‚’è€ƒãˆã‚‹ã€‚æ±äº¬ã«æ ¸ãƒŸã‚µã‚¤ãƒ«ãŒè½ã¡ã¦ãã¦ç‘æ³¢ã«ã‚·ã‚§ãƒ«ã‚¿ãƒ¼ãŒã‚ã‚‹ã¨ã‹ã€‚ã“ã®ã¨ãä½•æ™‚é–“ã§é¿é›£å¯èƒ½ã‹ã€ã¨ã„ã†å•é¡Œã‚’è§£ã
hrstt 2013/03/14
algorithm
ãƒªãƒ³ã‚¯
CAS - CalNet Authentication Service Login
How to Sign In as a SPA To sign in to a Special Purpose Account (SPA) via a list, add a "+" to your CalNet ID (e.g., "+mycalnetid"), then enter your passphrase. The next screen will show a drop-down list of all the SPAs you have permission to access. Select the SPA you wish to sign in as. To sign in directly as a SPA, enter the SPA name, "+", and your CalNet ID into the CalNet ID field (e.g., â€œspa
hrstt 2012/03/19
programming

Algorithm

python
ãƒªãƒ³ã‚¯
æƒ…å ±ç³»ä¿®å£«ã«ã‚‚ã‚ã‹ã‚‹ãƒ€ãƒ–ãƒ«é…åˆ— - ã‚¢ã‚¹ãƒšæ—¥è¨˜
æœ€è¿‘è©±é¡Œã®ã€Œæ—¥æœ¬èªžå…¥åŠ›ã‚’æ”¯ãˆã‚‹æŠ€è¡“ã€ã‚’é€”ä¸ã¾ã§èªã‚“ã ã€‚ 3ç« ãŒã‚‚ã®ã™ã”ãæ°—åˆã„ãŒå…¥ã£ã¦ã„ã‚‹ã€‚ trieï¼ˆãƒˆãƒ©ã‚¤ï¼‰ã¨ã„ã†ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã®2ã¤ã®å®Ÿè£…ã€ã€Œãƒ€ãƒ–ãƒ«é…åˆ—ã€ã¨ã€ŒLOUDSã€ã«ã¤ã„ã¦è©³ã—ãèª¬æ˜ŽãŒã•ã‚Œã¦ã„ã‚‹ã€‚ ãƒ€ãƒ–ãƒ«é…åˆ—ã«ã¤ã„ã¦ã¯ã€ã¼ãã¯ä»¥å‰è«–æ–‡ã‚’èªã‚“ã§å‹‰å¼·ã—ã‚ˆã†ã¨ã—ãŸã®ã ãŒã€ãã®æ™‚ã¯é›£ã—ãã¦ã‚ãã‚‰ã‚ãŸè¦šãˆãŒã‚ã‚‹ã€‚ã—ã‹ã—ã€ã“ã®æœ¬ã®èª¬æ˜Žã‚’èªã‚€ã“ã¨ã§ç†è§£ãŒã§ããŸã€‚ ã‚ã‚ŠãŒãŸã„ã€‚ æ„ŸéŠ˜ã‚’å—ã‘ãŸã®ã§ã€ã“ã®æœ¬ã‚’æ•™æã«å‹é”ã¨2äººå‹‰å¼·ä¼šã‚’ã—ãŸã€‚ ã“ã®2äººå‹‰å¼·ä¼šã¨ã„ã†ã®ã¯ã€ã¼ããŒå¾©ç¿’ã‚’å…¼ãã¦å‹é”ã«æ•™ãˆã‚‹ã¨ã„ã†ã®ãŒã ã„ãŸã„ã®ã‚¹ã‚¿ã‚¤ãƒ«ã€‚ ã—ã‹ã—ã€ã„ã–ã‚„ã£ã¦ã¿ã‚‹ã¨ã„ã‚ã„ã‚ã¨é›£ã—ã„ã€‚ æ¬¡ã®ã‚ˆã†ãªã¨ã“ã‚ã§ã²ã£ã‹ã‹ã‚‹ã‚ˆã†ã ã€‚ ä¾‹ã®ã‚µã‚¤ã‚ºãŒå°ã•ãã€ã‚¤ãƒ¡ãƒ¼ã‚¸ã‚’å–šèµ·ã™ã‚‹ã®ãŒé›£ã—ã„ã€‚ æœ€åˆã®å›³ã®ãƒŽãƒ¼ãƒ‰ç•ªå·ã¨ã€æœ€çµ‚çš„ãªãƒ€ãƒ–ãƒ«é…åˆ—ä¸Šã®ä½ç½®ãŒç•°ãªã‚‹ãŸã‚ã€æ··ä¹±ã™ã‚‹ã€‚ å˜èªžçµ‚ç«¯ã«ã¤ã„ã¦è¨€åŠãŒãªã„ã®ã§ã€ã©ã®ãƒŽãƒ¼ãƒ‰ãŒå˜èªžã‚’è¡¨ã—ã¦ã„ã‚‹ã‹ãŒã‚ã‹ã‚‰
hrstt 2012/02/19
algorithm

nlp
ãƒªãƒ³ã‚¯
Introducing CityHash
â–º 2025 (47) â–º December (6) â–º November (5) â–º October (3) â–º September (5) â–º August (5) â–º July (5) â–º June (3) â–º May (5) â–º April (1) â–º March (1) â–º February (3) â–º January (5) â–º 2024 (39) â–º December (4) â–º November (1) â–º October (1) â–º September (3) â–º August (4) â–º July (4) â–º June (4) â–º May (5) â–º April (4) â–º March (2) â–º February (6) â–º January (1) â–º 2023 (44) â–º December (5) â–º November (6) â–º October (2) â–º Se
hrstt 2012/02/13
algorithm

hash

google
ãƒªãƒ³ã‚¯
æ–°ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€Œé…åˆ—æŒ¿å…¥ã‚½ãƒ¼ãƒˆã€ã ! - hp12c
(è¿½è¨˜:2012-1-10) id:m11m ã•ã‚“ã®ã‚³ãƒ¡ãƒ³ãƒˆã«ã‚ˆã‚Šã“ã®ã‚½ãƒ¼ãƒˆã¯ãƒã‚±ãƒƒãƒˆã‚½ãƒ¼ãƒˆ*1ã¨å‘¼ã°ã‚Œã‚‹æ—¢çŸ¥ã®ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã§ã‚ã‚‹ã“ã¨ãŒã‚ã‹ã‚Šã¾ã—ãŸ ^^;ã€€è¿½è¨˜ã«ã‚ˆã‚ŠãŠè©«ã³ç”³ã—ä¸Šã’ã¾ã™ (è¿½è¨˜:2012-1-12) è¨˜äº‹ã«å¯¾ã™ã‚‹ã‚¢ã‚¯ã‚»ã‚¹ãŒç•°å¸¸ãªã®ã§èª¿ã¹ã¦ã¿ã‚‹ã¨ã€dankogaiæ°ã®ãƒã‚¿ã«ã•ã‚Œã¦ã„ãŸã¨ã„ã†åèª‰ã‚’å—ã‘ã¦ã„ãŸã“ã¨ãŒåˆ¤æ˜Žã—ã¾ã—ãŸ^^; å…‰æ „ã§ã™ 404 Blog Not Found:algorithm - bucket sort - æ¯”è¼ƒã—ãªã‘ã‚Œã°ã‚½ãƒ¼ãƒˆã¯ç›¸å½“é€Ÿã„ - ä»¥å‰ã«ã‚¹ãƒªãƒ¼ãƒ—ã‚½ãƒ¼ãƒˆã¨ã„ã† ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒç™ºè¦‹ã•ã‚ŒãŸã‚ˆã å¸¸è˜ã‚’è¦†ã™ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ï¼ãã®åã‚‚"sleep sort"ï¼ - Islands in the byte stream ã§åƒ•ã¯ã“ã‚Œã«å¯¾æŠ—ã—ã¦ãƒ©ãƒ³ãƒ‹ãƒ³ã‚°ã‚½ãƒ¼ãƒˆ ã£ã¦ã„ã†ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’è¦‹ã¤ã‘ãŸã‚“ã ã‚ˆ ã¾ã‚å¤±æ•—ã—ãŸã‚“ã ã‘ã©.. sleep sort
hrstt 2012/01/10
algorithm

ruby
ãƒªãƒ³ã‚¯
Support Vector Machines (SVM) in Ruby - igvita.com
By Ilya Grigorik on January 07, 2008 Your Family Guy fan-site is riding a wave of viral referrals, the community has grown tenfold in last month alone! First, you've deployed an SVD recommendation system, then you've optimized the site content and layout with the help of decision trees, but of course, that wasn't enough, and you've also added a Bayes classifier to help you filter and rank the cont
hrstt 2011/07/04
svm

ruby

algorithm
ãƒªãƒ³ã‚¯
ãƒ•ã‚£ãƒœãƒŠãƒƒãƒæ•°ã¨ã²ã¾ã‚ã‚Š - ã¾ã‚ã‚ã‚‚
æœ€è¿‘ä½•ã‹ã¨è©±é¡Œã®ãƒ•ã‚£ãƒœãƒŠãƒƒãƒæ•°è¨ˆç®—ã®é«˜é€ŸåŒ–ã§ã™ãŒã€ F(n) = (fib(n+1), fib(n)) ï¼ˆ2æ¬¡å…ƒã®ç¸¦ãƒ™ã‚¯ãƒˆãƒ«ã ãŒè¡¨è¨˜ã®éƒ½åˆã§æ¨ªã«æ›¸ãï¼‰ A = ((1, 1), (1, 0)) ï¼ˆç¬¬1è¡ŒãŒ(1, 1)ã§ç¬¬2è¡ŒãŒ(1, 0)ã®è¡Œåˆ—ï¼‰ã€€ã™ã‚‹ã¨ï¼ŒF(n) = A F(n-1) = A A F(n-2) = A A A F(n-3) = ...ã¨ãªã‚‹ã‹ã‚‰ï¼ŒF(n)ã‚’è¨ˆç®—ã™ã‚‹ãŸã‚ã«ã¯ï¼ŒAã®nä¹—ã‚’è¨ˆç®—ã—ã¦ï¼Œãã‚Œã«å³ã‹ã‚‰F(0)ã‚’ã‹ã‘ã‚Œã°è‰¯ã„ã“ã¨ã«ãªã‚‹ã€‚ è¨ˆç®—é‡ã®å·¥å¤«ã§ãƒ—ãƒã‚°ãƒ©ãƒ ã¯åŠ‡çš„ã«é€Ÿããªã‚‹ ä»¥å‰ã“ã®è¨˜äº‹ã‚’èªã‚“ã ã¨ãã‚‚ã€ã¯ã¯ãƒ¼ã€ã¨æ€ã£ãŸã®ã§ã™ãŒã€ãã®ã¨ãã¯å®Ÿè£…ã—ã¦ã¿ãªã‹ã£ãŸã®ã§ã¡ã‚‡ã£ã¨å®Ÿè£…ã—ã¦ã¿ã¾ã—ãŸã€‚ require "matrix" def fib(n) aux = proc do |m, a| case m when 0 then Matrix.I(2) when 1 then
hrstt 2011/06/27
ruby

algorithm
ãƒªãƒ³ã‚¯
GPSè¨ˆç®—å¼
1.Â Â Â Â Â Â Â å¹³é¢ç›´è§’åº§æ¨™x,yã‹ã‚‰ç·¯åº¦ï¼ŒçµŒåº¦ãŠã‚ˆã³ååˆç·šåŽå·®ã‚’æ±‚ã‚ã‚‹è¨ˆç®— (1)Â Â ç·¯åº¦ (2)Â Â çµŒåº¦ (3)Â Â ååˆç·šåŽå·®è§’ (4)Â Â ç¸®å°ºä¿‚æ•° 2.Â Â Â Â Â Â Â ç·¯åº¦çµŒåº¦ã‹ã‚‰å¹³é¢ç›´è§’åº§æ¨™x,yãŠã‚ˆã³ååˆç·šåŽå·®ã‚’æ±‚ã‚ã‚‹è¨ˆç®— (1)Â Â xåº§æ¨™ (2)Â Â yåº§æ¨™ (3)Â Â ååˆç·šåŽå·®è§’ (4)Â Â ç¸®å°ºä¿‚æ•° 3.Â Â Â Â Â Â Â 2ç‚¹ã®å¹³é¢ç›´è§’åº§æ¨™x,yã‹ã‚‰æ¸¬åœ°ç·šé•·ãŠã‚ˆã³æ–¹å‘è§’ã‚’æ±‚ã‚ã‚‹è¨ˆç®— (1)Â Â æ¸¬åœ°ç·šé•· (2)Â Â æ–¹å‘è§’ 4.Â Â Â Â Â Â Â æ¥•å††ä½“ã®åŽŸåï¼Œè«¸å…¬å¼ãŠã‚ˆã³å®šæ•°ã«ã¤ã„ã¦ (1)Â Â æ¥•å††ä½“ã®åŽŸå (2)Â Â æ¥•å††ä½“ã®è«¸å…¬å¼ 5.Â Â Â Â Â Â Â ç·¯åº¦ã‚’ä¸Žãˆã¦èµ¤é“ã‹ã‚‰ã®ååˆç·šå¼§é•·ã‚’æ±‚ã‚ã‚‹è¨ˆç®— 6.Â Â Â Â Â Â Â èµ¤é“ã‹ã‚‰ã®ååˆç·šå¼§é•·ã‚’ä¸Žãˆã¦ç·¯åº¦ã‚’æ±‚ã‚ã‚‹è¨ˆç®— 7.Â Â Â Â Â Â Â å¹³é¢ç›´è§’åº§æ¨™ç³» 8.Â Â
hrstt 2011/06/13
programming

GIS

algorithm
ãƒªãƒ³ã‚¯
- ã‚µãƒ«ã§ã‚‚ã‚ã‹ã‚‹å¾…ã¡è¡Œåˆ—
(æ ª)æ°¸å’Œã‚·ã‚¹ãƒ†ãƒ ãƒžãƒã‚¸ãƒ¡ãƒ³ãƒˆÂ Â Â å¹³é‹å¥å… ä½œæˆæ—¥ï¼šåˆç‰ˆ 1999, 3/16 ç¬¬2ç‰ˆ 2002, 11/6 ç¬¬3ç‰ˆ 2004, 9/14 ç¬¬4ç‰ˆ 2008, 5/1 æƒ…å ±å‡¦ç†æŠ€è¡“ç¤¾è©¦é¨“ã®ä¸ã§è‰¯ãå‡ºã¦æ¥ã‚‹ã€Œå¾…ã¡è¡Œåˆ—ã€ç†è«–ã‚’ï¼Œç›´æ„Ÿçš„ã«è¦šãˆã‚„ã™ãè§£èª¬ã—ã¦ã¿ã¾ã—ãŸï¼Ž ä½•åº¦ã‚‚ãƒˆãƒ©ã‚¤ã—ãŸã‘ã©å¾…ã¡è¡Œåˆ—ãŒç†è§£ã§ããªã„äººå‘ã‘ã§ã™ï¼Ž æ£ç¢ºãªå®šç¾©ã‚„è«–ç†å±•é–‹ã¯é‡è¦–ã›ãšï¼Œã„ã‹ã«åŠ¹çŽ‡çš„ã«ã“ã®ç†è«–ã‚’è¦šãˆã‚‹ã“ã¨ãŒã§ãã‚‹ã‹ã«ç„¦ç‚¹ã‚’çµžã£ã¦ã¿ã¾ã—ãŸï¼Ž
hrstt 2011/05/27
programming

algorithm
ãƒªãƒ³ã‚¯
å¸¸è˜ã‚’è¦†ã™ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ï¼ãã®åã‚‚"sleep sort"ï¼ - Islands in the byte stream (legacy)
Twitterã®TLã§çŸ¥ã£ãŸã®ã ãŒã€å°‘ã—å‰ã«æµ·å¤–ã®æŽ²ç¤ºæ¿ã§"sleep sort"ã¨ã„ã†ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒç™ºæ˜Žã•ã‚Œã€å…¬é–‹ã•ã‚ŒãŸã‚ˆã†ã ã€‚ã“ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ãŒé¢ç™½ã‹ã£ãŸã®ã§ç´¹ä»‹ã—ã¦ã¿ã‚‹ã€‚ Genius sorting algorithm: Sleep sort 1 Name: Anonymous : 2011-01-20 12:22 è«¸å›ï¼ã‚ªãƒ¬ã¯å¤©æ‰ã‹ã‚‚ã—ã‚Œãªã„ã€‚ã“ã®ã‚½ãƒ¼ãƒˆã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’ã¿ã¦ãã‚Œã€‚ã“ã„ã¤ã‚’ã©ã†æ€ã†ï¼Ÿ #!/bin/bash function f() { sleep "$1" echo "$1" } while [ -n "$1" ] do f "$1" & shift done wait example usage: ./sleepsort.bash 5 3 6 3 6 3 1 4 7 2 Name: Anonymous : 2011-01-20 12:27 >>1 ãªã‚“â€¦ã ã¨
hrstt 2011/05/20
algorithm
ãƒªãƒ³ã‚¯
MinHashã«ã‚ˆã‚‹é«˜é€Ÿãªé¡žä¼¼æ¤œç´¢ - Preferred Networks Tech Blog
å¹´ãŒæ˜Žã‘ã¦ã‚‚ã†ä¸€ãƒ¶æœˆçµŒã¡ã¾ã—ãŸãï¼Žå²¡é‡ŽåŽŸã§ã™ï¼Ž ä»Šæ—¥ã¯MinHashã¨å‘¼ã°ã‚Œã‚‹æ‰‹æ³•ã‚’ç´¹ä»‹ã—ã¾ã™ï¼Žã“ã‚Œã¯ç‰¹å¾´ãƒ™ã‚¯ãƒˆãƒ«ã®é«˜é€Ÿãªé¡žä¼¼æ¤œç´¢ã«åˆ©ç”¨ã™ã‚‹ã“ã¨ãŒã§ãã¾ã™(ã‚¯ãƒãƒ¼ãƒ©ãƒ¼ã®æ–‡è„ˆã ã¨Shingleã¨ã—ã¦çŸ¥ã‚‰ã‚Œã¦ã„ã‚‹ï¼‰ï¼Ž ä»Šã‚„ä¸–ã®ä¸ã®ã‚ã‚‰ã‚†ã‚‹ç¨®é¡žã®ãƒ‡ãƒ¼ã‚¿ãŒï¼Œé«˜æ¬¡å…ƒã®ãƒã‚¤ãƒŠãƒªãƒ™ã‚¯ãƒˆãƒ«ã‹ã‚‰ãªã‚‹ç‰¹å¾´ãƒ™ã‚¯ãƒˆãƒ«ã§è¡¨ã•ã‚Œã¦å‡¦ç†ã•ã‚Œã‚‹ã‚ˆã†ã«ãªã£ã¦ãã¾ã—ãŸï¼Žä¾‹ãˆã°æ–‡æ›¸ãƒ‡ãƒ¼ã‚¿ã§ã‚ã‚Œã°æ–‡æ›¸ä¸ã«å‡ºç¾ã™ã‚‹å˜èªžã‚„ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã®å‡ºç¾æƒ…å ±ã‚’ä¸¦ã¹ãŸå˜èªžç©ºé–“ãƒ™ã‚¯ãƒˆãƒ«ï¼ˆBag of Wordsï¼‰ã§è¡¨ã—ï¼Œç”»åƒãƒ‡ãƒ¼ã‚¿ã‚‚ï¼ŒSIFTã‚’ã¯ã˜ã‚ã¨ã—ãŸå±€æ‰€ç‰¹å¾´é‡ã‚’ä¸¦ã¹ãŸç‰¹å¾´ãƒ™ã‚¯ãƒˆãƒ«ï¼ˆã¨ãã‚Œã‚’SkecthåŒ–ã—ãŸã‚‚ã®ï¼‰ã¨ã—ã¦è¡¨ã›ã¾ã™ï¼Žè¡Œå‹•æƒ…å ±ã‚„æ™‚ç³»åˆ—ãƒ‡ãƒ¼ã‚¿ã‚‚ç‰¹å¾´é‡ã‚’ã†ã¾ãæŠ½å‡ºã™ã‚‹ï¼Žã‚°ãƒ©ãƒ•ãƒ‡ãƒ¼ã‚¿ã‚‚Fast subtree kernels[1]ã¨å‘¼ã°ã‚Œã‚‹æ–¹æ³•ã§éžå¸¸ã«åŠ¹çŽ‡çš„ã«ç‰¹å¾´ãƒ™ã‚¯ãƒˆãƒ«ã«å¤‰æ›ã™ã‚‹ã“ã¨ãŒã§ãï¼Œã‚°ãƒ©ãƒ•ã®ç‰¹å¾´ã‚’ã‚ˆãæ‰ãˆã‚‹ã“ã¨ãŒã§ãã‚‹ã®ãŒæœ€è¿‘ã‚ã‹ã£
hrstt 2011/02/02
algorithm

LSH
ãƒªãƒ³ã‚¯
é›†åˆçŸ¥ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚° 2ç« - é¡žä¼¼åº¦è¨ˆç®—ã®æ¯”è¼ƒ - ãŸãã£ã¦ã¤ã¥ã‚‹
id:plasticscafe ãŒã€Œé›†åˆçŸ¥ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã€ã‚’Pythonã‹ã‚‰Scalaã«ç¿»è¨³ã—ãªãŒã‚‰å†™çµŒã—ã¦ã„ãã¨ã„ã†ã®ã§ï¼Œ å°»é¦¬ã«ä¹—ã£ã¦è‡ªåˆ†ã‚‚ã‚„ã£ãŸæ°—ã«ãªã£ã¦ã¿ã‚ˆã† ã¡ã‚‡ã£ã¨ãŠæ‰‹ä¼ã„ãŒã¦ã‚‰è‡ªåˆ†ã‚‚ã‚„ã£ã¦ã¿ã¾ã—ãŸï¼Ž ã¾ã¨ã‚ Scalaã§é›†åˆçŸ¥ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚° é›†åˆçŸ¥ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚° ä½œè€…: Toby Segaran,ç•¶å±±ä»å¥,é´¨æ¾¤çœžå¤«å‡ºç‰ˆç¤¾/ãƒ¡ãƒ¼ã‚«ãƒ¼: ã‚ªãƒ©ã‚¤ãƒªãƒ¼ã‚¸ãƒ£ãƒ‘ãƒ³ç™ºå£²æ—¥: 2008/07/25ãƒ¡ãƒ‡ã‚£ã‚¢: å¤§åž‹æœ¬è³¼å…¥: 91äºº ã‚¯ãƒªãƒƒã‚¯: 2,220å›žã“ã®å•†å“ã‚’å«ã‚€ãƒ–ãƒã‚° (267ä»¶) ã‚’è¦‹ã‚‹ æœ¬é¡Œ ã€Œé›†åˆçŸ¥ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã€2ç« ã®ã‚¨ã‚¯ã‚µã‚µã‚¤ã‚ºã« Tanimotoä¿‚æ•°ã«ã¤ã„ã¦èª¿æŸ»ã€æ¤œè¨Žã—ã¦ã¿ã‚‹ ã¨ã„ã†ã®ãŒã‚ã‚‹ãã†ãªã®ã§ï¼Œã‚³ã‚µã‚¤ãƒ³é¡žä¼¼åº¦ã¨æ¯”è¼ƒã—ã¦ã¿ã¾ã—ãŸ*1ï¼Ž ä»¥ä¸‹ï¼Œå‹˜ã«é ¼ã‚‹éƒ¨åˆ†ãŒå¤§ãã„ã®ã§è©³ã—ã„äººã‹ã‚‰ã‚³ãƒ¡ãƒ³ãƒˆã»ã—ã„ã£ï¼ æ•°å¼ã§æ¯”è¼ƒ æ¯”è¼ƒã™ã‚‹ãƒ‡ãƒ¼ã‚¿ã®çµ„ã‚’ä¸‹ã®ã‚ˆã†ã«nå€‹ãšã¤ã®ãƒ™ã‚¯ãƒˆãƒ«ï¼ˆé…åˆ—ï¼‰ã¨ã—
hrstt 2011/01/27
ruby

algorithm
ãƒªãƒ³ã‚¯
Clever Algorithms: Nature-Inspired Programming Recipes
Need help getting started with Genetic Algorithms, Neural Networks or Swarm Intelligence? Nature-Inspired Algorithms are Fascinating! But implementing them can be frustrating. The algorithm descriptions are incomplete, inconsistent and distributed across academic papers, websites and code. There are so many algorithms to choose from, it can feel overwhelming. Algorithms Handbook You need a handboo
hrstt 2011/01/26
programming

algorithm
ãƒªãƒ³ã‚¯
ã‚³ã‚µã‚¤ãƒ³è·é›¢ãƒ™ãƒ¼ã‚¹ã®LSHã‚’Rubyã§ - <s>gnarl,</s>æŠ€è¡“ãƒ¡ãƒ¢â€â€™<marquee><textarea>ï¿¥
å‚è€ƒæ–‡çŒ®:Web+DB press vol.49 ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ‰ç‰¹é›†ã®Part3ãªã©ã€‚ ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®æ¦‚è¦ è©³ç´°(ç‰¹ã«æ•°å¦çš„ãª)ã¯ããã‚Œã€‚ ãƒ¢ãƒãƒ™ãƒ¼ã‚·ãƒ§ãƒ³ã¨ã—ã¦ã¯ã€é«˜æ¬¡å…ƒã«ãŠã‘ã‚‹è¿‘å‚ç‚¹æŽ¢ç´¢ã‚’é«˜é€Ÿã§è¡Œã„ãŸã„ã€‚ã¾ã˜ã‚ã«ã‚„ã‚‹ã¨ã©ã†å·¥å¤«ã—ã¦ã‚‚è¨ˆç®—é‡ãŒã™ã”ã„ã“ã¨ã«ãªã‚‹ã®ã§ã€è¿‘ä¼¼ã§ã€‚ ã©ã†ã™ã‚‹ã‹ã¨ã„ã†ã¨ã€ã€Œè·é›¢ãŒè¿‘ã„ã¨åŒã˜ã‚ˆã†ãªå€¤ã«ãªã‚‹ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã€ã‚’ä½¿ã†ã€‚ã‚ã‚‹ãƒ™ã‚¯ãƒˆãƒ«ã®è¿‘å‚ã‚’æ±‚ã‚ãŸã„å ´åˆã€ãã®ãƒ™ã‚¯ãƒˆãƒ«ã®ãƒãƒƒã‚·ãƒ¥ã¨åŒã˜(ã‚‚ã—ãã¯è¿‘ã„)å€¤ã®ãƒãƒƒã‚·ãƒ¥ã‚’æŒã¤ãƒ™ã‚¯ãƒˆãƒ«ã‚’ãƒ†ãƒ¼ãƒ–ãƒ«ã‹ã‚‰å¼•ã„ã¦ãã¦è¿”ã™ã€‚è¨ˆç®—é‡ãŒã©ã†ãªã‚‹ã‹ã¯ã‚„ã‚„ã“ã—ã„ã‘ã©ã€ã¨ã‚Šã‚ãˆãšå…¨éƒ¨æŽ¢ã™ã‚ˆã‚Šã¯é€Ÿã„ã€‚ ã§ã€ã©ã†ã„ã†é–¢æ•°ã‚’ãƒãƒƒã‚·ãƒ¥ã¨ã™ã‚‹ã®ã‹ã€‚ã“ã‚Œã¯è·é›¢ã®å®šç¾©ã«ã‚ˆã£ã¦ç•°ãªã‚‹ã€‚ãƒãƒŸãƒ³ã‚°è·é›¢ã€ã‚³ã‚µã‚¤ãƒ³è·é›¢ã€ãƒ¦ãƒ¼ã‚¯ãƒªãƒƒãƒ‰è·é›¢ãªã©ã«ã¯ãã†ã„ã£ãŸé–¢æ•°ã®å˜åœ¨ãŒçŸ¥ã‚‰ã‚Œã¦ã„ã‚‹ã€‚ ã‚³ã‚µã‚¤ãƒ³è·é›¢ã®å ´åˆã€ãƒ©ãƒ³ãƒ€ãƒ ãªãƒ™ã‚¯ãƒˆãƒ«ã‚’ã„ãã¤ã‹ç”¨æ„ã—ã¦ã€å…¥åŠ›ã•ã‚ŒãŸãƒ™ã‚¯ãƒˆãƒ«ãŒãã‚Œã‚‰ã¨ä¼¼ã¦ã„ã‚‹
hrstt 2011/01/22
algorithm

ruby
ãƒªãƒ³ã‚¯
((Pythonã§) æ›¸ã (Lisp) ã‚¤ãƒ³ã‚¿ãƒ—ãƒªã‚¿)
Peter Norvig / é’æœ¨é– è¨³ ã“ã®ãƒšãƒ¼ã‚¸ã«ã¯2ã¤ã®ç›®çš„ãŒã‚ã‚‹ã€‚ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿è¨€èªžã®å®Ÿè£…ã«ã¤ã„ã¦ä¸€èˆ¬çš„ãªè¨˜è¿°ã‚’ã™ã‚‹ã“ã¨ã¨ã€Lispã®æ–¹è¨€ã§ã‚ã‚‹Schemeã®ã‚µãƒ–ã‚»ãƒƒãƒˆã‚’Pythonã§å®Ÿè£…ã™ã‚‹å…·ä½“çš„ãªæ–¹æ³•ã‚’ç¤ºã™ã“ã¨ã§ã‚ã‚‹ã€‚ç§ã¯ã“ã®ã‚¤ãƒ³ã‚¿ãƒ—ãƒªã‚¿ã‚’Lispy (lis.py)ã¨å‘¼ã¶ã€‚ä½•å¹´ã‹å‰ã«ç§ã¯Javaã¨Common Lispã§Schemeã‚¤ãƒ³ã‚¿ãƒ—ãƒªã‚¿ã‚’æ›¸ãæ–¹æ³•ã‚’ç¤ºã—ãŸã€‚ä»Šå›žã®ç›®æ¨™ã¯ã€ã‚¢ãƒ©ãƒ³ãƒ»ã‚±ã‚¤ãŒã€Œã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã®ãƒžã‚¯ã‚¹ã‚¦ã‚§ãƒ«æ–¹ç¨‹å¼ã€ã¨å‘¼ã‚“ã ã¨ã“ã‚ã®ç°¡æ½”ã•ã¨å–ã£ã¤ãã‚„ã™ã•ã‚’å¯èƒ½ãªé™ã‚Šå®Ÿç¾ã™ã‚‹ã¨ã„ã†ã“ã¨ã ã€‚ Schemeã®ã‚µãƒ–ã‚»ãƒƒãƒˆLispy ã®æ§‹æ–‡ã¨æ„å‘³è«– ã‚³ãƒ³ãƒ”ãƒ¥ãƒ¼ã‚¿è¨€èªžã®å¤šãã¯æ§˜ã€…ãªæ§‹æ–‡çš„ãªæ±ºã¾ã‚Š(ã‚ãƒ¼ãƒ¯ãƒ¼ãƒ‰ã€ä¸ç½®æ¼”ç®—åã€ã‚«ãƒƒã‚³ã€æ¼”ç®—åå„ªå…ˆé †ã€ãƒ‰ãƒƒãƒˆè¨˜æ³•ã€ã‚»ãƒŸã‚³ãƒãƒ³ãªã©)ã‚’æŒã£ã¦ã„ã‚‹ãŒã€Lispæ—è¨€èªžã®1ã¤ã¨ã—ã¦ã€Schemeã®æ§‹æ–‡ã¯ã™ã¹ã¦ã‚«ãƒƒã‚³ä»˜ãã®å‰ç½®è¨˜æ³•ã§ã‚ã‚‹ãƒªã‚¹ãƒˆã‚’åŸºæœ¬ã¨ã—
hrstt 2010/10/04
ã‚¤ãƒ³ã‚¿ãƒ—ãƒªã‚¿ã®ã‚µãƒ³ãƒ—ãƒ«

python

lisp

algorithm
ãƒªãƒ³ã‚¯
GeoHashã®decodeã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®è§£èª¬ã—ã¾ã™ & Scalaã®GeoHashãƒ©ã‚¤ãƒ–ãƒ©ãƒªã‚’ä½œã£ã¦ã¿ã¾ã—ãŸ(ä»®) - ( ê’ªâŒ“ê’ª) ã‚†ã‚‹ã‚ˆã‚æ—¥è¨˜
GeoHash(http://en.wikipedia.org/wiki/Geohash)ã¯ã€ç·¯åº¦çµŒåº¦ã‚’æ–‡å—åˆ—ã®ãƒãƒƒã‚·ãƒ¥ã§è¡¨ç¾ã™ã‚‹ä»•æ§˜ã§ã™ã€‚ GeoHashã«ã‚ˆã‚Šè¡¨ç¾ã•ã‚ŒãŸç·¯åº¦çµŒåº¦ã®æƒ…å ±ã¯ã€ä¸€ã¤ã®æ–‡å—åˆ—ã§ç·¯åº¦ã¨çµŒåº¦ã¨ã„ã†2æ¬¡å…ƒã®æƒ…å ±ã«åŠ ãˆã¦ç²¾åº¦ã‚‚è¡¨ã™ã“ã¨ãŒã§ãã‚‹ã¨ã„ã†ç‰¹å¾´ã‚’æŒã£ã¦ã„ã¾ã™ã€‚ ä¾‹ãˆã°ã€ã©ã†ã§ã—ã‚‡ã†ãƒã‚«ã®è–åœ°ã§ã‚ã‚‹åŒ—æµ·é“æœå¹Œå¸‚ã®å¹³å²¸é«˜å°å…¬åœ’ã¯ã€åŒ—ç·¯43.025æ±çµŒ141.377ã§ã™ãŒã€ã“ã‚Œã‚’GeoHashã§è¡¨ç¾ã™ã‚‹ã¨ã€"xpssc0"ã¨ãªã‚Šã¾ã™ã€‚ ã“ã®"xpssc0"ã¨ã„ã†GeoHashè¡¨ç¾ã¯ã€ã€ŒåŒ—ç·¯43.0224609375ã‹ã‚‰43.0279541015625ã®é–“ã§ã€æ±çµŒ141.3720703125ã‹ã‚‰141.383056640625ã®çŸ©å½¢ç¯„å›²ã€ã§ã‚ã‚Šã€åº§æ¨™ã¯ã“ã®çŸ©å½¢ç¯„å›²ã®ä¸å¿ƒç‚¹ã«ãªã‚Šã¾ã™ã€‚ @masuidrive blogã•ã‚“ã®ç·¯åº¦çµŒåº¦ã‚’æ–‡å—åˆ—ã§è¡¨ã™GeoHash - @ma
hrstt 2010/02/05
algorithm

geohash
ãƒªãƒ³ã‚¯
ãƒ©ãƒ³ãƒ€ã‚¦ã®è¨˜å· - Wikipedia
ã‚¹ã‚¿ãƒ¼ãƒªãƒ³ã‚°ã®å…¬å¼ã¯ãƒ©ãƒ³ãƒ€ã‚¦ã®è¨˜å·ã‚’ç”¨ã„ã¦ã¨æ›¸ãã“ã¨ã‚‚ã§ãã‚‹ã€‚ ãƒ©ãƒ³ãƒ€ã‚¦ã®è¨˜å·ï¼ˆãƒ©ãƒ³ãƒ€ã‚¦ã®ãã”ã†ã€è‹±: Landau symbolï¼‰ã¯ã€ä¸»ã«é–¢æ•°ã®æ¥µé™ã«ãŠã‘ã‚‹æ¼¸è¿‘çš„ãªæŒ™å‹•ã‚’æ¯”è¼ƒã™ã‚‹ã¨ãã«ç”¨ã„ã‚‰ã‚Œã‚‹è¨˜æ³•ã§ã‚ã‚‹ã€‚è‹±èªžåœã§ã¯ä¸€èˆ¬çš„ã«ãƒ“ãƒƒã‚°ãƒ»ã‚ªãƒ¼ï¼ˆBig Oï¼‰ã¨å‘¼ã°ã‚Œã‚‹ã€‚ ãƒ©ãƒ³ãƒ€ã‚¦ã®æ¼¸è¿‘è¨˜æ³• (asymptotic notation)ã€ãƒ©ãƒ³ãƒ€ã‚¦è¨˜æ³• (Landau notation) ã‚ã‚‹ã„ã¯ä¸»è¦ãªè¨˜å·ã¨ã—ã¦ O ï¼ˆæ•°å—ã®0ã§ã¯ãªã„ï¼‰ã‚’ç”¨ã„ã‚‹ã“ã¨ã‹ã‚‰ï¼ˆãƒãƒƒãƒãƒžãƒ³-ãƒ©ãƒ³ãƒ€ã‚¦ã®ï¼‰O-è¨˜æ³• (Bachmann-Landau O-notation[1])ãªã©ã¨ã‚‚ã„ã†ã€‚ è¨˜å· O ã¯ãƒ‰ã‚¤ãƒ„èªžã®Ordnungã®é å—ã«ã¡ãªã‚€[2]ã€‚ ãªãŠã“ã“ã§ã„ã†ãƒ©ãƒ³ãƒ€ã‚¦ã¯ã‚¨ãƒˆãƒ ãƒ³ãƒˆãƒ»ãƒ©ãƒ³ãƒ€ã‚¦ã®äº‹ã§ã‚ã‚Šã€ã€Žç†è«–ç‰©ç†å¦æ•™ç¨‹ã€ã®è‘—è€…ã§ã‚ã‚‹ãƒ¬ãƒ•ãƒ»ãƒ©ãƒ³ãƒ€ã‚¦ã¨ã¯åˆ¥äººã§ã‚ã‚‹ã€‚ ãƒ©ãƒ³ãƒ€ã‚¦ã®è¨˜å·ã¯æ•°å¦ã‚„è¨ˆç®—æ©Ÿç§‘å¦ã‚’ã¯ã˜ã‚ã¨ã—ãŸæ§˜ã€…ãªåˆ†é‡Žã§ç”¨ã„
hrstt 2009/09/03
algorithm

wikipedia

math
ãƒªãƒ³ã‚¯
å¾®åˆ†æ–¹ç¨‹å¼ã‚’è§£ã“ã†ï¼ | _level0 - KAYAC Front Engineer Blog
ã©ã†ã‚‚ã€‚ã“ã‚“ã«ã¡ã¯ã€‚æ¢…é›¨æ˜Žã‘ã‚‚å®£è¨€ã•ã‚ŒãŸãã†ã§ã€ã„ã‚ˆã„ã‚ˆæš‘ããªã‚Šã¾ã™ãã€‚ä»Šå›žã¯å˜æŒ¯å‹•æ–¹ç¨‹å¼æ–¹ç¨‹å¼ã‚’ç”¨ã„ãŸæœ€é©åŒ–ã®ãŠè©±ã§ã™ã€‚ é«˜æ ¡ç‰©ç†ã§ã‚‚ç™»å ´ã™ã‚‹ãƒãƒã®æ–¹ç¨‹å¼ã€å˜æŒ¯å‹•æ–¹ç¨‹å¼ ã‚’ç°¡å˜ãªå››å‰‡è¨ˆç®—ã«åˆ†è§£ã™ã‚‹æ–¹æ³•ã‚’ç´¹ä»‹ã—ã¾ã™ã€‚ ã¾ãšè‰²ã€…ãªæ•°å¦çš„èƒŒæ™¯ã‚’æŠ¼ã—ã‚„ã£ã¦ã€ã‚¤ãƒ¡ãƒ¼ã‚¸ã ã‘èª¬æ˜Žã™ã‚‹ã¨ã€ç‰©ä½“ã®ä½ç½®xã€é€Ÿåº¦vã€åŠ é€Ÿåº¦aã®é–¢ä¿‚ã¯ ã¨ãªã‚‹ã®ã§ã€asã®å¼ã§è€ƒãˆã‚‹ã¨ã€ v += a; x += v; ã¨ã„ã†é¢¨ã«ãªã‚Šã¾ã™ã€‚ã“ã“ã§å˜æŒ¯å‹•ã®å¾®åˆ†æ–¹ç¨‹å¼ã‹ã‚‰ã€ a = -K * x; ã§ã‚ã‚‹ã‹ã‚‰ã€ã‚ã‚ã›ã‚‹ã¨ã€ v -= K * x; x += v; ã¨ã„ã†é¢¨ã«ãªã‚Šã¾ã™ã€‚ä¸‹ãŒã‚µãƒ³ãƒ—ãƒ«ã§ã€åˆæœŸå€¤(_v, _y)ã‚„Kãªã‚“ã‹ã‚’å¤‰ãˆã¦æŒ™å‹•ãŒå¤‰ã‚ã‚‹ã“ã¨ãŒåˆ†ã‹ã‚Šã¾ã™ã€‚ ã“ã“ã§ã®ãƒã‚¤ãƒ³ãƒˆã¯vã«å¯¾ã—ã¦æœ€åˆã®å¼ã§ç ´å£Šçš„ãªæ“ä½œã‚’è¡Œã£ã¦ã„ã‚‹ã“ã¨ã§ã™ã€‚ v_temp = v; v -= K * x; x += v_temp; ç‰ã¨ã™ã‚‹ã¨ã€ãšã‚Œã¦ã—
hrstt 2009/07/15
ActionScript

algorithm
ãƒªãƒ³ã‚¯
ã»ã¼æ—¥åˆŠã‚¤ãƒˆã‚¤æ–°èž -ãƒžãƒƒãƒç®±ã®è„³ï¼ˆWEBï¼‰ç¯‡
ã€Œãƒžãƒƒãƒç®±ã®è„³ã€ã¨ã„ã†æ£®å·ãã‚“ãŒæ›¸ã„ãŸæœ¬ã¯ã€ ãã®ä¸–ç•Œã§ã€ã‹ãªã‚Šã®è©•åˆ¤ã‚’å‘¼ã‚“ã§ã„ã¾ã™ã€‚ ã¾ã ã€å£²ã‚Šå‡ºã•ã‚Œã¦ã¾ã‚‚ãªã„ã“ã®æœ¬ã‚’ã€ æ£®å·å›ã€WEBç”¨ã«å†ç·¨é›†ã—ã¦ã€ ã€Œã»ã¼æ—¥ã€ã«é€£è¼‰ã—ã¦ãã‚Œã‚‹ã“ã¨ã«ãªã‚Šã¾ã—ãŸã€‚ ãªã‚“ã¨ãµã¨ã£ã±ã‚‰ã§ã€éª¨æƒœã—ã¿ã—ãªã„ç”·ãªã®ã§ã—ã‚‡ã†ï¼Ÿï¼ â—†æ°—å‰ãŒã„ã„ã ã‘ã˜ã‚ƒç”Ÿãã‚‰ã‚Œãªã„ã€‚ ãŸã ã®ã‚±ãƒã§ã¯ç”Ÿãã¦ã„ã‚‹è³‡æ ¼ãŒãªã„ã€‚ è¬¹ã‚“ã§ã€æ„Ÿè¬ã®æ„ã‚’ã“ã‚ã¦ã€ä¸Šè¨˜ã®ã“ã¨ã°ã‚’ æ£®å·ãã‚“ã«ã•ã•ã’ã•ã›ã¦ã„ãŸã ãã¾ã™ã€‚
hrstt 2009/07/06
algorithm

programming
ãƒªãƒ³ã‚¯
Steve Krenzel - 18. Distributed Computing: MapReduce and HashFold
This is a post about HashFold, a theoretical framework (for now) that is suited to performing the same types of distributed computation that MapReduce can perform, but improves upon MapReduce both in runtime and memory usage. This is quite a claim so I'm putting the idea out there for public scrutiny. If you're familiar with MapReduce, HashFold does away with sorting values and the concept of a co
hrstt 2009/07/04
MapReduce

algorithm

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