[B! algorithm] ka-nachtã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

ka-nacht id:ka-nacht

algorithmã«é–¢ã™ã‚‹ka-nachtã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (14)

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

murmurhash
Not your computer? Use a private browsing window to sign in. Learn more about using Guest mode
ka-nacht 2009/09/25
/

prog

algorithm

hash
ãƒªãƒ³ã‚¯
Gauche:æµ®å‹•å°æ•°ç‚¹æ•°ã‚’ã©ã“ã¾ã§èªã‚€ã‹
(2008/12/21 15:04:15 PST) ãã£ã‹ã‘ã¯ã²ã¨ã¤ã®ãƒã‚°ãƒ¬ãƒãƒ¼ãƒˆã€‚å°æ•°ç‚¹ä»¥ä¸‹ã®æ¡æ•°ãŒ309æ¡ã‚’è¶Šãˆã‚‹æµ®å‹•å°æ•°ç‚¹æ•°ã‚’Gauche (0.8.14) ã«èªã¾ã›ã‚‹ã¨inf.0ãŒè¿”ã‚‹ã€‚ gosh> 1.098612288668109691395245236922525704647490557822749451734694333637494293218608966873615754813732088787970029065957865742368004225930519821052801870767277410603162769183381367179373698844360959903742570316795911521145591917750671347054940166775580222203170252946897560690106521505642868138036317
ka-nacht 2008/12/22
ã¸ãƒ¼ >ã“ã®å•é¡Œã¯å¯¾è±¡æ¡ãŒã©ã‚“ãªã«å°ã•ãã¦ã‚‚èµ·ã“ã‚Šå¾—ã‚‹ã®ã§ã€å°æ•°ç‚¹æ•°ä»¥ä¸‹ã®æ•°å—ã¯ æœ€å¾Œã¾ã§èªã‚“ã§ä½¿ã‚ãªã„ã¨ã ã‚ãªã®ã ã€‚

prog

math

algorithm

reading
ãƒªãƒ³ã‚¯
Hash tree - Wikipedia
This disambiguation page lists articles associated with the title Hash tree. If an internal link led you here, you may wish to change the link to point directly to the intended article.
ka-nacht 2008/12/21
prog

doc

algorithm
ãƒªãƒ³ã‚¯
Fenwick tree - Algorithmist
Fenwick tree (aka Binary indexed tree) is a data structure that maintains a sequence of elements, and is able to compute cumulative sum of any range of consecutive elements in O(logâ¡n) time. Changing value of any single element needs O(logâ¡n) time as well. The structure is space-efficient in the sense that it needs the same amount of storage as just a simple array of n elements. The basic rule tha
ka-nacht 2008/08/20
prog

algorithm

data-structure
ãƒªãƒ³ã‚¯
https://dl.acm.org/citation.cfm?id=1109601
ka-nacht 2008/06/07
prog

algorithm

distributed
ãƒªãƒ³ã‚¯
spiteful.com
Get a price in less than 24 hours Fill out the form below. One of our domain experts will have a price to you within 24 business hours.
ka-nacht 2008/03/23
unrolled linked lists / van emde boas trees / soft deletes / skip lists / bdbã¯ãªã‚“ã‹ã¡ãŒã†ããŒ

prog

algorithm
ãƒªãƒ³ã‚¯
MurmurHash, final version.
UPDATE - If you're reading this via a link from Google or Reddit, please go here - http://murmurhash.googlepages.com. All future updates about MurmurHash will be posted there. UPDATEUPDATE - MurmurHash is now at version 2.0. The new version uses a different mix function than the below that is much faster & mixes better. Code is on the website linked above. OK, I'm done with this for the time being
ka-nacht 2008/03/11
prog

hash

algorithm
ãƒªãƒ³ã‚¯
è¦–è¦šéšœå®³è€…ã®ãŸã‚ã®èªã¿ãŒãªã«ã‚ˆã‚‹å…¨æ–‡æ¤œç´¢ã‚·ã‚¹ãƒ†ãƒ ã€ãã®ææ¡ˆã¨å®Ÿè£…
æ¦‚è¦ æœ¬è¨˜äº‹ã§ã¯è¦–è¦šéšœå®³è€…ã®åˆ©ç”¨ã‚’æƒ³å®šã—ãŸã€ æ¼¢å—ã‚’ãµãã‚€æ—¥æœ¬èªžæ–‡å—åˆ—ã‚’èªã¿ãŒãªã ã‘ã§æ¤œç´¢ã™ã‚‹ã‚·ã‚¹ãƒ†ãƒ ã‚’ææ¡ˆã™ã‚‹ã€‚ æœ¬æ‰‹æ³•ã¯ bi-gram ã¨å‹•çš„è¨ˆç”»æ³•ã‚’ã‚‚ã¡ã„ã¦ã€æ¼¢å—ã‚’å«ã‚€æ–‡å—åˆ—ã‚’ ã™ã¹ã¦ã®å¯èƒ½ãªèªã¿æ–¹ã§åŠ¹çŽ‡çš„ã«ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã€ãŠã‚ˆã³æ¤œç´¢ã™ã‚‹ã“ã¨ã‚’å¯èƒ½ã«ã™ã‚‹ã€‚ è©¦é¨“çš„ãªå®Ÿè£…ã«ã‚ˆã‚Šã€æœ¬æ‰‹æ³•ãŒå¤§è¦æ¨¡ãªæ–‡æ›¸æ¤œç´¢ã«å¿œç”¨å¯èƒ½ã§ã‚ã‚‹ã“ã¨ã€ ã¾ãŸç´”ç²‹ãªèªã¿ãŒãªã ã‘ã®æ¤œç´¢ã§ã¯ä¸ååˆ†ãªå ´åˆãŒã‚ã‚‹ã“ã¨ã‚’ç¤ºã™ã€‚ 1. èƒŒæ™¯ 2. åŸºæœ¬çš„ãªæ©Ÿæ§‹ 2.1. æ¤œç´¢ã®æµã‚Œ 3. ã‚¤ãƒ³ãƒ‡ã‚¯ã‚·ãƒ³ã‚°ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 4. ãƒžãƒƒãƒãƒ³ã‚°ã®ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ 5. è¾žæ›¸ãƒ•ã‚¡ã‚¤ãƒ«ã®æœ€é©åŒ– 6. ç‚¹å—è¦å‰‡ã®è¿½åŠ 7. è©•ä¾¡å®Ÿé¨“ 7.1. å®Ÿè£… 7.2. å®Ÿé¨“ã«ç”¨ã„ãŸæ–‡æ›¸é›†åˆ 7.3. ã‚¤ãƒ³ãƒ‡ã‚¯ã‚·ãƒ³ã‚°ã®åŠ¹çŽ‡ 7.4. æ¤œç´¢ã®åŠ¹çŽ‡ 8. æ®‹ã•ã‚ŒãŸèª²é¡Œ 8.1. æ¤œç´¢çµæžœã®ãƒ©ãƒ³ã‚ãƒ³ã‚°ãŠã‚ˆã³ãƒ•ã‚£ãƒ«ã‚¿ãƒªãƒ³ã‚° 8.2. èªã¿ãŒãªä»¥å¤–ã«ã‚ˆã‚‹è¡¨è¨˜ã®ã‚†ã‚Œ 8
ka-nacht 2008/02/21
algorithm

text

fooling

python
ãƒªãƒ³ã‚¯
Google Research Publication: Bigtable: A Distributed Storage System for Structured Data
Bigtable: A Distributed Storage System for Structured Data Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, and Robert E. Gruber Abstract Bigtable is a distributed storage system for managing structured data that is designed to scale to a very large size: petabytes of data across thousands of commodity servers. Many projec
ka-nacht 2008/01/22
prog

algorithm
ãƒªãƒ³ã‚¯
Gmane Loom
ka-nacht 2008/01/05
prog

lua

algorithm

fuzzy

search
ãƒªãƒ³ã‚¯
ç½‘ç«™åŸŸåæœªå¤‡æ¡ˆï¼
ka-nacht 2006/11/17
åˆ†æ•£å‡¦ç†ã®ãƒˆãƒªãƒƒã‚¯(ãƒãƒ–ãƒ«ã‚½ãƒ¼ãƒˆãŒãƒžãƒ¼ã‚¸ã‚½ãƒ¼ãƒˆã«?)

prog

algorithm

dist
ãƒªãƒ³ã‚¯
Mersenne Twister: A random number generator (since 1997/10)
English Version News: MTToolBox ã‚’GitHubã§å…¬é–‹ã—ã¾ã—ãŸã€‚(2013/10/04) TinyMTã‚’ãƒªãƒªãƒ¼ã‚¹ã—ã¾ã—ãŸã€‚ (2011/06/20) MTGPã‚’ãƒªãƒªãƒ¼ã‚¹ã—ã¾ã—ãŸã€‚(2009/11/17) SIMD-oriented Fast Mersenne Twister (SFMT) ã‚’ãƒªãƒªãƒ¼ã‚¹ã—ã¾ã—ãŸã€‚ SFMTã¯ã‚ªãƒªã‚¸ãƒŠãƒ«ã®Mersenne Twisterã‚ˆã‚Šç´„äºŒå€é€Ÿãã€ ã‚ˆã‚Šã‚ˆã„å‡ç‰åˆ†å¸ƒç‰¹æ€§ã‚’æŒã¡ã€é›¶è¶…éŽåˆæœŸçŠ¶æ…‹ã‹ã‚‰ã®å›žå¾©ã‚‚é«˜é€Ÿã§ã™ã€‚ SFMTã®ãƒšãƒ¼ã‚¸ã‚’è¦‹ã¦ãã ã•ã„ã€‚ (2007/1/31) ãŠé¡˜ã„ï¼šä½¿ã†æ™‚ã«em ailã‚’ä¸€é€šä¸‹ã•ã‚Œã°ã€ ä»Šå¾Œã®æ”¹è‰¯ã®ã¯ã’ã¿ã«ãªã‚Šã¾ã™ã€‚ ã©ã‚“ãªã•ã•ã„ãªå•é¡Œç‚¹ã§ã‚‚ã€è¦‹ã¤ã‘æ¬¡ç¬¬å¾¡é€£çµ¡ä¸‹ã•ã„ã€‚ m-mat ï¼ math.sci.hiroshima-u.ac.jp (ã“ã®ãƒ¡ãƒ¼ãƒ«ã‚¢ãƒ‰ãƒ¬ã‚¹ã¯ ã‚¹ãƒšãƒ¼ã‚¹ã‚’æŠœã„ã¦æ‰‹ã§æ‰“ã¡ç›´ã—ã¦ãã ã•ã„)
ka-nacht 2006/10/27
prog

algorithm
ãƒªãƒ³ã‚¯
OBB vs AABB - Radium Software Development
Domain for sale radiumsoftware.com Free transaction support Secure payments Spaceship reliability Listed with spaceship.com
ka-nacht 2006/10/21
"Finding Frequent Items in Data Streams" / ä½•æ•…ã“ã‚Œã§è¿‘ä¼¼ã§ãã‚‹?

prog

doc

algorithm
ãƒªãƒ³ã‚¯
æœ€å°å®Œå…¨ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã®ä½œã‚Šæ–¹
â– é †åˆ—åž‹ã®æœ€å°å®Œå…¨ãƒãƒƒã‚·ãƒ¥é–¢æ•° ï¼ã‹ã‚‰ï¼”ã¾ã§ã®ï¼•å€‹ã®æ•°å—ãŒä¸‹ã®ã‚ˆã†ã«ä¸¦ã‚“ã§ã„ã‚‹å ´åˆã‚’ä¾‹ã«ã—ã¦èª¬æ˜Žã—ã¾ã™ã€‚ ï¼•å€‹ã®æ•°å—ã®ä¸¦ã¹æ–¹ã¯ï¼•ï¼é€šã‚Šã‚ã‚Šã¾ã™ã®ã§ï¼•ï¼(=120)é€šã‚Šã®ä¸¦ã¹æ–¹ã®ç·ã¦ã«å¯¾ã—ã¦0ã‹ã‚‰119ã¾ã§ã®æ•°å€¤ã‚’ä¸€æ„ã«å‰²ã‚Šä»˜ã‘ã‚‹ã“ã¨ãŒç›®çš„ã¨ãªã‚Šã¾ã™ã€‚ ï¼“ï¼”ï¼‘ï¼ï¼’ ã“ã“ã§ã¯å·¦å´ã‹ã‚‰é †ã«æ•°å—ã‚’è¦‹ã¦ã„ãã“ã¨ã«ã—ã¾ã™ã€‚æœ€åˆã®æ•°å—ã¯ï¼“ã§æ®‹ã‚Šã®æ•°å—ã®å€‹æ•°ã¯ï¼”å€‹ã§ã™ãã€‚ ã“ã®æ®‹ã‚Œã•ãŸæ•°å—ã®å€‹æ•°åˆ†ã®ç·é †åˆ—æ•°ã¯ï¼”ï¼ã§ã™ãŒã€ã“ã®æ•°é‡ã‚’åŸºæ•°ã¨è¨€ã„ã¾ã™ã€‚ ã¤ã¾ã‚Šå·¦ç«¯ã®æ•°å—ãŒä½•ã§ã‚ã‚‹ã‹ã‚’å®Œå…¨ã«è˜åˆ¥ã™ã‚‹ç‚ºã«æœ€ä½Žé™å¿…è¦ãªåŸºæœ¬ã¨ãªã‚‹é‡ã¿ã®ã“ã¨ã§ã™ã€‚ å¾“ã£ã¦å…ˆãšæœ€åˆã®æ•°å—ï¼“ã«åŸºæ•°ã§ã‚ã‚‹ï¼”ï¼ã‚’æŽ›ã‘ç®—ã—ã¦ã¯ã˜ãå‡ºã—ã¾ã™ã€‚ [ï¼“]ï¼”ï¼‘ï¼ï¼’ã€€â†’ã€€ï¼“ï¼Šï¼”ï¼ æ¬¡ã«å·¦ã‹ã‚‰ï¼’ç•ªç›®ã®æ•°å—ã§ã™ãŒã€ã“ã“ã‹ã‚‰å…ˆã¯ã¨ã¦ã‚‚æ³¨æ„ãŒå¿…è¦ã§ã™ã€‚ ï¼’ç•ªç›®ã®æ•°å—ã¯ï¼”ã§æ®‹ã‚Šã®æ•°å—ã®å€‹æ•°ã¯ï¼“å€‹ã§ã™ã€‚æ®‹ã‚Šã®æ•°å—ã®å€‹æ•°ãŒï¼“å€‹ãªã®ã§åŸºæ•°ã¯ï¼“ï¼ã«ãªã‚Šã¾ã™ã€‚ã¤ã¾ã‚ŠåŸºæ•°ãŒå¤‰åŒ–
ka-nacht 2006/03/28
prog

doc

algorithm
ãƒªãƒ³ã‚¯
1