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

taketyan id:taketyan

algorithmã«é–¢ã™ã‚‹taketyanã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (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}}

è»¢ç½®ã‚¤ãƒ³ãƒ‡ãƒƒã‚¯ã‚¹ã¨Top k-query
7. ä»£è¡¨çš„ãªã‚¯ã‚¨ãƒªã®ã‚¿ã‚¤ãƒ— ï‚ž ANDæ¤œç´¢ (Conjunctive query) ï‚— ã‚¯ã‚¨ãƒªï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ = (ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½1 , â€¦ , ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ )ãŒä¸Žãˆã‚‰ã‚ŒãŸæ™‚ã«å…¨ã¦ã®ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ ãŒå«ã¾ã‚Œã‚‹æ–‡ç« ã‚’è¿”ã™ ï‚— ä¾‹ : ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ = (ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½â„Ž, ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½, ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½)ãªã‚‰ã°â€watchâ€, â€œiwcâ€, â€œrolexâ€å…¨ã¦ãŒå«ã¾ã‚Œã‚‹æ–‡ç« ã‚’è¿”ã™ ï‚ž ORæ¤œç´¢ (Disjunctive query) ï‚— ã‚¯ã‚¨ãƒªï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ = (ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½1 , â€¦ , ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ )ãŒä¸Žãˆã‚‰ã‚ŒãŸæ™‚ã«ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ ã®ã„ãš ã‚Œã‹ãŒå«ã¾ã‚Œã‚‹æ–‡ç« ã‚’è¿”ã™ ï‚— ä¾‹ : ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ = (ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½ï¿½
taketyan 2012/02/15
é€”ä¸ã§ã‚®ãƒ–ã—ãŸã‘ã© DAAT ã¡ã‚ƒã‚“ã¨ç†è§£ã—ãŸã„.

algorithm
ãƒªãƒ³ã‚¯
Perlã®hash - mizuno_takaakiã®æ—¥è¨˜
Perlã®hashã£ã¦ç›¸å½“ä½¿ã£ã¦ã‚‹ã‘ã©ã€ä¸èº«çŸ¥ã‚‰ãªã„ãªãƒ¼ã€ã¨ãµã¨æ€ã„ã€èª¿ã¹ã¦ã¿ãŸã‚‰ã€ã“ã‚“ãªãƒšãƒ¼ã‚¸ãŒã‚ã£ãŸã€‚ http://www.perl.com/lpt/a/679 2002å¹´ã«æ›¸ã‹ã‚ŒãŸã‚‚ã®ã§ã€ã¡ã‚‡ã£ã¨å¤ã„ã‘ã‚Œã©ã€èªã‚“ã§ã„ã£ãŸã‚‰ã€è©³ã—ãçŸ¥ã‚ŠãŸã‹ã£ãŸã‚‰ã¨ã‚Šã‚ãˆãšPerl 1.0ã®hash.cã‹ã‚‰å§‹ã‚ãŸã‚‰ã„ã„ã‚“ã˜ã‚ƒãªã„ã‹ã¿ãŸã„ãªã“ã¨ã‹ã‚‰æ›¸ã„ã¦ã‚ã£ã¦ã€ãªã‚‹ã»ã©ã¨æ€ã£ã¦èªã‚“ã§ã¿ãŸã€‚çŸã„ã€‚ ä¸Žãˆã‚‰ã‚ŒãŸã‚ãƒ¼ã‹ã‚‰ãƒ‡ãƒ¼ã‚¿ã®å…¥ã£ã¦ã„ã‚‹å ´æ‰€ã‚’æŽ¢ã™ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã¨ã—ã¦ã¯ã€ä»¥ä¸‹ã¿ãŸã„ãªãƒ«ãƒ¼ãƒ—ã€‚ for (s=key,i=0,hash = 0; /* while */ *s; s++,i++,hash *= 5) { hash += *s * coeff[i]; } oentry = &(tb->tbl_array[hash & tb->tbl_max]); ã“ã‚“ãªæ„Ÿã˜ã§ã€ã‚ãƒ¼ã®æ–‡å—ï¼‘æ–‡å—ãšã¤ã‚’ä½¿ã£ã¦coeffã¨ã„
taketyan 2012/01/22
perl

algorithm

hash
ãƒªãƒ³ã‚¯
ãƒãƒƒã‚·ãƒ¥é–¢æ•° - Wikipedia
ã“ã®è¨˜äº‹ã¯æ¤œè¨¼å¯èƒ½ãªå‚è€ƒæ–‡çŒ®ã‚„å‡ºå…¸ãŒå…¨ãç¤ºã•ã‚Œã¦ã„ãªã„ã‹ã€ä¸ååˆ†ã§ã™ã€‚ å‡ºå…¸ã‚’è¿½åŠ ã—ã¦è¨˜äº‹ã®ä¿¡é ¼æ€§å‘ä¸Šã«ã”å”åŠ›ãã ã•ã„ã€‚ï¼ˆã“ã®ãƒ†ãƒ³ãƒ—ãƒ¬ãƒ¼ãƒˆã®ä½¿ã„æ–¹ï¼‰ å‡ºå…¸æ¤œç´¢?:Â "ãƒãƒƒã‚·ãƒ¥é–¢æ•°"Â â€“Â ãƒ‹ãƒ¥ãƒ¼ã‚¹Â Â· æ›¸ç±Â Â· ã‚¹ã‚«ãƒ©ãƒ¼Â Â· CiNiiÂ Â· J-STAGEÂ Â· NDLÂ Â· dlib.jpÂ Â· ã‚¸ãƒ£ãƒ‘ãƒ³ã‚µãƒ¼ãƒÂ Â· TWL (2018å¹´6æœˆ) ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã§åå‰ã¨0ã‹ã‚‰15ã¾ã§ã®æ•´æ•°ã‚’ãƒžãƒƒãƒ”ãƒ³ã‚°ã—ã¦ã„ã‚‹ã€‚"John Smith" ã¨ "Sandra Dee" ã®ãƒãƒƒã‚·ãƒ¥å€¤ãŒè¡çªã—ã¦ã„ã‚‹ã€‚ ãƒãƒƒã‚·ãƒ¥é–¢æ•° (ãƒãƒƒã‚·ãƒ¥ã‹ã‚“ã™ã†ã€è‹±èªž: hash function) ã‚ã‚‹ã„ã¯è¦ç´„é–¢æ•°[1]ã¨ã¯ã€ä»»æ„ã®ãƒ‡ãƒ¼ã‚¿ã‹ã‚‰ã€åˆ¥ã®ï¼ˆå¤šãã®å ´åˆã¯çŸã„å›ºå®šé•·ã®ï¼‰å€¤ã‚’å¾—ã‚‹ãŸã‚ã®æ“ä½œã€ã¾ãŸã¯ã€ãã®æ§˜ãªå€¤ã‚’å¾—ã‚‹ãŸã‚ã®é–¢æ•°ã®ã“ã¨ã€‚ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã‹ã‚‰å¾—ã‚‰ã‚ŒãŸå€¤ã®ã“ã¨ã‚’è¦ç´„å€¤ã‚„ãƒãƒƒã‚·ãƒ¥å€¤ã¾ãŸã¯å˜ã«ãƒãƒƒã‚·ãƒ¥ã¨ã„ã†ã€‚ ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã¯ã€ä¸»ã«
taketyan 2012/01/15
ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã®ç‰¹æ€§ã«ã¤ã„ã¦ã®ç®‡æ‰€ã¨ã‹ã‹ãªã‚Šå‹‰å¼·ã«ãªã‚‹

programming

algorithm
ãƒªãƒ³ã‚¯
Bæœ¨ - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
æ˜¨å¹´ã‹ã‚‰ç¶šã„ã¦ã„ã‚‹ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚¤ãƒ³ãƒˆãƒãƒ€ã‚¯ã‚·ãƒ§ãƒ³è¼ªè¬›ã‚‚ã€æ—©ã„ã‚‚ã®ã§æ¬¡ã¯18ç« ã§ã™ã€‚18ç« ã®ãƒ†ãƒ¼ãƒžã¯Bæœ¨(B Tree, Bãƒ„ãƒªãƒ¼) ã§ã™ã€‚Bæœ¨ã¯ãƒžãƒ«ãƒã‚¦ã‚§ã‚¤å¹³è¡¡æœ¨(å¤šåˆ†æœ¨ã«ã‚ˆã‚‹å¹³è¡¡æœ¨)ã§ã€ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã‚„ãƒ•ã‚¡ã‚¤ãƒ«ã‚·ã‚¹ãƒ†ãƒ ãªã©ã§ã‚‚è‰¯ãä½¿ã‚ã‚Œã‚‹é‡è¦ãªãƒ‡ãƒ¼ã‚¿æ§‹é€ ã§ã™ã€‚Bæœ¨ã¯ä¸€ã¤ã®æœ¨ã®é ‚ç‚¹ã«ã¶ã‚‰ä¸‹ãŒã‚‹æžã®æœ¬æ•°ã®ä¸‹é™ã¨ä¸Šé™ã‚’è¨ã‘ãŸä¸Šã€å¸¸ã«å¹³è¡¡æœ¨ã§ã‚ã‚‹ã“ã¨ã‚’åˆ¶ç´„ã¨ã—ãŸãƒ‡ãƒ¼ã‚¿æ§‹é€ ã«ãªã‚Šã¾ã™ã€‚ è¼ªè¬›ã®äºˆç¿’ãŒã¦ã‚‰ã€Bæœ¨ã‚’ Python ã§å®Ÿè£…ã—ã¦ã¿ã¾ã—ãŸã€‚ã‚½ãƒ¼ã‚¹ã‚³ãƒ¼ãƒ‰ã‚’æœ€å¾Œã«æŽ²è¼‰ã—ã¾ã™ã€‚ä»¥ä¸‹ã¯ Bæœ¨ã«é–¢ã™ã‚‹è€ƒå¯Ÿã§ã™ã€‚ Bæœ¨ãŒãªãœé‡è¦ãªã®ã‹ Bæœ¨ãŒé‡è¦ãªã®ã¯ã€Bæœ¨(ã®å¤‰ç¨®ã§ã‚ã‚‹B+æœ¨*1ãªã©)ãŒäºŒæ¬¡è¨˜æ†¶è£…ç½®ä¸Šã§åŠ¹çŽ‡è‰¯ãæ“ä½œã§ãã‚‹ã‚ˆã†ã«è¨è¨ˆã•ã‚ŒãŸãƒ‡ãƒ¼ã‚¿æ§‹é€ ã ã‹ã‚‰ã§ã™ã€‚ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã‚’åˆ©ç”¨ã™ã‚‹ã‚¦ã‚§ãƒ–ã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³ãªã©ã€äºŒæ¬¡è¨˜æ†¶(ãƒãƒ¼ãƒ‰ãƒ‡ã‚£ã‚¹ã‚¯)ä¸Šã®å¤§é‡ã®ãƒ‡ãƒ¼ã‚¿ã‚’æ‰±ã†ã‚½ãƒ•ãƒˆã‚¦ã‚§ã‚¢ã‚’é‹ç”¨ã—ãŸçµŒé¨“ãŒã‚ã‚‹æ–¹ãªã‚‰ã€ã„ã‹ã«ãƒ‡ã‚£
taketyan 2011/03/11
å¸°ã£ãŸã‚‰èªã‚€.

algorithm

datastructure
ãƒªãƒ³ã‚¯
Bæœ¨ (B-tree)
â–¡ å¤šãƒ¬ãƒ™ãƒ«ç´¢å¼•ã®ä¸€ç¨® æŒ¿å…¥ã‚„å‰Šé™¤ã®ã‚¿ã‚¤ãƒŸãƒ³ã‚°ã§å‹•çš„ãªå†ç·¨æˆãŒåŠ¹çŽ‡è‰¯ãå¯èƒ½ï¼Ž ãƒ¬ãƒ™ãƒ«æ•°ã¯å±¤ãƒ¬ã‚³ãƒ¼ãƒ‰æ•° ã«å¯¾ã—ã¦ ã§ã™ã‚€ï¼Ž â–¡ B-tree ã‚ˆã‚Šã‚‚å¾Œè¿°ã® B-tree ã®æ–¹ãŒè‰¯ãä½¿ã‚ã‚Œã‚‹ãŒï¼ŒåŽŸç†ã® ç†è§£ã¯ B-tree ã®æ–¹ãŒç†è§£ã—ã‚„ã™ã„ã®ã§ï¼Œå…ˆã«èª¬æ˜Žã™ã‚‹ï¼Ž ä»¥ä¸‹ã§ã¯ã‚ãƒ¼å€¤ã«é‡è¤‡ãŒãªã„ã‚‚ã®ã¨ä»®å®šã™ã‚‹ï¼Ž å®šç¾© 8 (Bæœ¨ (B-tree)) Â ãŒæ£æ•´æ•°ã§ã‚ã‚‹ã¨ã™ã‚‹ï¼Žæ¬¡ã® Bæœ¨ (a B-tree of degree ) ã® å„ãƒŽãƒ¼ãƒ‰ã¯æ¬¡ã®ã‚ˆã†ãªæƒ…å ±ã‚’æŒã¤ãƒšãƒ¼ã‚¸ã§ï¼Œä»¥ä¸‹ã«è¿°ã¹ã‚‹æ¡ä»¶ã‚’æº€ãŸã™ã‚‚ã®ã§ã‚ã‚‹ (å›³ 6.5, p112 å‚ç…§ï¼Ž): ã¯root ãƒŽãƒ¼ãƒ‰ä»¥å¤–ã§ã¯ ã§ã‚ã‚‹ï¼Ž root ãƒŽãƒ¼ãƒ‰ã§ã¯ ã§ã‚ã‚‹ï¼Ž ãƒ¬ã‚³ãƒ¼ãƒ‰ ã®ã‚ãƒ¼å€¤ã‚’ ã§è¡¨ã™ã¨ã™ã‚‹ã¨ï¼Œ ã§ã‚ã‚‹ï¼Ž ãƒ¬ã‚³ãƒ¼ãƒ‰ã¯æœ€å¤§ã§ å€‹ã¾ã§æŒã¦ã‚‹ï¼Ž ã¯ãƒšãƒ¼ã‚¸ã¸ã®ãƒã‚¤ãƒ³ã‚¿ã§ã‚ã‚‹ï¼Ž (ã¤ã¾ã‚Šéƒ¨åˆ†æœ¨ã¸ã®ãƒã‚¤ãƒ³ã‚¿ã§ã‚ã‚‹ï¼Ž) ä¸ã«ç¾ã‚Œã‚‹å…¨ã¦ã®ãƒ¬ã‚³ãƒ¼ãƒ‰
taketyan 2011/02/06
algorithm

datastructure
ãƒªãƒ³ã‚¯
Build a Binary Tree in Ruby | Jacob Repp
Building algorithms in ruby is fun and rewarding. This binary tree doesnâ€™t balance itself but it is simple and flexible using ruby blocks for visit and insert. Traversal style can be selected optionally to visit with :inorder, :preorder or :postorder. Hereâ€™s your basic binary tree node representation, it holds a value and connects to a left and right node: class Node # binary tree representation a
taketyan 2011/02/05
algorithm

datastructure
ãƒªãƒ³ã‚¯
2009å¹´åº¦ | æƒ…å ±èªè˜ - TOKYO TECH OCW
è¬›ç¾©è³‡æ–™ã‚’å…¨ä¸–ç•Œã«å‘ã‘ã¦ç„¡å„Ÿã§å…¬é–‹ã—ã€æœ€é«˜æ°´æº–ã®ç†å·¥ç³»æ•™è‚²ã‚’å…¨ä¸–ç•Œã®å…±æœ‰è²¡ç”£ã¨ã™ã¹ãæä¾›ã™ã‚‹ãƒ—ãƒ©ãƒƒãƒˆãƒ•ã‚©ãƒ¼ãƒ ã§ã™
taketyan 2011/01/17
algorithm

prml
ãƒªãƒ³ã‚¯
å¤§è¦æ¨¡ãƒ‡ãƒ¼ã‚¿ã§å˜èªžã®æ•°ã‚’æ•°ãˆã‚‹ - ny23ã®æ—¥è¨˜
å¤§è¦æ¨¡ãƒ‡ãƒ¼ã‚¿ã‹ã‚‰ one-pass ã§ it emï¼ˆn-gram ãªã©ï¼‰ã®é »åº¦ã‚’æ•°ãˆã‚‹æ‰‹æ³•ã«é–¢ã™ã‚‹ãƒ¡ãƒ¢ï¼Žã“ã“æ•°å¹´ï¼Œæ¯Žå¹´ã®ã‚ˆã†ã«è¶…å¤§è¦æ¨¡ãª n-gram ã®çµ±è¨ˆæƒ…å ±ã‚’ç©ºé–“ï¼æ™‚é–“åŠ¹çŽ‡è‰¯ãåˆ©ç”¨ã™ã‚‹ãŸã‚ã®æ‰‹æ³•ãŒææ¡ˆã•ã‚Œã¦ã„ã‚‹ï¼Žæœ€è¿‘ã ã¨ï¼Œ Storing the Web in Memory: Space Efficient Language Models with Constant Time Retrieval (EM NLP 2010) ã¨ã‹ï¼Žã“ã®è«–æ–‡ã§ã¯ï¼Œæœ€å°å®Œå…¨ãƒãƒƒã‚·ãƒ¥é–¢æ•°ã‚„ power-law ã‚’è€ƒæ…®ã—ãŸé »åº¦è¡¨ç¾ã®åœ§ç¸®ãªã©ï¼Œç´°ã‹ã„æŠ€è¡“ã‚’ä¸å¯§ã«çµ„ã¿ä¸Šã’ã¦ãŠã‚Šï¼Œã“ã‚Œãã‚‰ã„å·¥å¤«ãŒç´°ã‹ããªã£ã¦ãã‚‹ã¨log-frequency Bloom filter (ACL 2007) ãã‚‰ã„ã‹ã‚‰ã‹ã‚‰å§‹ã¾ã£ãŸ n-gram é »åº¦æƒ…å ±ã®åœ§ç¸®ã®ç ”ç©¶ã‚‚ãã‚ãã‚åŽæŸã—ãŸã‹ã¨ã„ã†å°è±¡ï¼ˆã¡ã‚‡ã†ã©è«–æ–‡ã‚’èªã‚€ç›´å‰ã«ï¼Œã“ã®è«–æ–‡ã®7ç¯€ã®
taketyan 2010/11/17
ngram

nlp

algorithm
ãƒªãƒ³ã‚¯
Face Detection in JavaScript via HTML5 Canvas
Badass JavaScriptA showcase of awesome JavaScript that pushes the boundaries of what's possible on the web, by @devongovett. You have probably seen face detection at work in programs like iPhoto and Picasa, but what if you could do that performantly in JavaScript? Â Chinese developer Liu Liu has done the honors, and implemented the algorithmÂ using the canvas element. The algorithm is implemented on
taketyan 2010/11/03
javascript

algorithm

html5

face detection
ãƒªãƒ³ã‚¯
N.M-gramï¼šãƒãƒƒã‚·ãƒ¥å€¤ä»˜ãN-gramç´¢å¼•ã«ã‚ˆã‚‹å…¨æ–‡æ¤œç´¢ã®ä¸€æ‰‹æ³• | CiNii Research
JaLC IRDB Crossref DataCite NDLã‚µãƒ¼ãƒ NDLãƒ‡ã‚¸ã‚³ãƒ¬ï¼ˆæ—§NII-ELSï¼‰ RUDA JDCat NINJAL CiNii Articles CiNii Books DBpedia Nikkei BP KAKEN Integbio MDR PubMed LSDB Archive æ¥µåœ°ç ”ADS æ¥µåœ°ç ”å¦è¡“DB OpenAIRE å…¬å…±ãƒ‡ãƒ¼ã‚¿ã‚«ã‚¿ãƒã‚° ãƒ ãƒ¼ãƒ³ã‚·ãƒ§ãƒƒãƒˆåž‹ç ”ç©¶é–‹ç™ºäº‹æ¥
taketyan 2010/11/01
ngram

algorithm
ãƒªãƒ³ã‚¯
yuya-takeyama's Ngram at master - GitHub
taketyan 2010/10/19
php

algorithm

ngram

programming
ãƒªãƒ³ã‚¯
1