What: The third general meeting of LLVM Developers and Users. Why: To get acquainted, learn how LLVM is used, and exchange ideas. When: October 2, 2009 SPONSORED BY: Apple, Google, Adobe, Qualcomm Incorporated The meeting serves as a forum for both LLVM and Clang developers and users to get acquainted, lea rn how LLVM is used, and exchange ideas about LLVM and its (potential) applications. More br
One of the more hidden aspects of HBase is how data is actually stored. While the majority of users may never have to bother about it you may have to get up to speed when you want to learn what the various advanced configuration options you have at your disposal mean. "How can I tune HBase to my needs?", and other similar questions are certainly interesting once you get over the (at times steep) l
Make a note of it: Web tech, montaineering, and so on. ç´ ã®ç¶æ ã§ãã«ãã³è¯ãããã¹ãè¨æ³ãMarkdownãå®ç¨ããã¢ã¬ã³ã¬ããããã¯å¦ä½ã«ãã¦ç§ã¯Markdownå½¢å¼ã®å®ç¨åã«è³ã£ããã Markdownã«é¢ãã¦ã¯ååã®Sugamoã§ã触ããããã©ãã¾ããã£ãè¯ããã¯ã¦ãªè¨æ³ãã¨èãã¦å·®ãæ¯ããªããVimã§ä½¿ãã¨ãHTMLã»ã©æ°åãå ¥ããªãã¦ãè²åã表示ã§ããããã¡ãã£ã¨ããã¡ã¢æ¸ããããã°ã®ä¸æ¸ãã¨ãã¦éå®ãã¦ã¾ããHTMLç´æ¸ãã許容ããããã¼ãè¨æ³ã£ã¦ã®ããã¤ã³ãé«ãã ããã¦ä¿ºã¯æã£ãããã使ã£ã¦ãgfããã¦ããã°ãVimWikiè¦ããªãããããï¼ ã¾ãã¯çéãã Hack #52: Markdownå½¢å¼ã®ææ¸ãæ¸ã Hack #7: ç·¨éä¸ãã¡ã¤ã«ãå®è¡ããçµæã表示ããã¾ã¾ã«ãã ããã辺ãåèã«ã´ãã§ã´ãã§ãã£ã¦ã¿ãã®
gmane.org ã¯ãããªãããæ¢ãã®æ å ±ã®å ¨ã¦ã®ææ°ãã¤æé©ãªã½ã¼ã¹ã§ããä¸è¬ãããã¯ããããããæ¤ç´¢ã§ããå 容ã¯ãgmane.orgãå ¨ã¦ã¨ãªãã¾ããããªãããæ¢ãã®å 容ãè¦ã¤ãããã¨ãé¡ã£ã¦ãã¾ãï¼
Creating robust applications using open source databases and commodity hardware Baron Schwartz started a good discussion about MMM use cases that quickly veered into an argument about clustering in general. As Florian Haas put it on his blog, this is not just an issue of DRBD vs. MySQL Replication. Is a database cluster something you cobble together through bits and pieces like MMM? Or is it somet
Skip Graphs James Aspnes, Gauri Shah Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), January 2003, pp. 384-393. Submitted to Journal of Algorithms. Abstract Skip graphs are a novel distributed data structure, based on skip lists, that provide the full functionality of a balanced tree in a distributed system where elements are stored in separate nodes that may fail at any time.
MeCabã¯å½¢æ ç´ è§£æã®ããã®ã½ããã¦ã§ã¢ã§ããæ¥æ¬èªãåãã¡æ¸ãããããã«ä½¿ããããã®ã¨ãã¦ã¯æã人æ°ã®é«ããã®ã ã¨æããã¾ããããã£ãããæ²ç¤ºæ¿ã«æ¸ãè¾¼ã¾ãããããªå´©ããæ¥æ¬èªããæ£ããæ¸ãããæ¥æ¬èªã§ãæ°èªãæå¾ ããéãã«åãã¡æ¸ããã¦ãããªããã¨ãããã¾ããããã¯MeCabã®å é¨ã§ä½¿ããã¦ããè¾æ¸ãä¸è¬çãªè¨èãæ å ±æºã¨ãã¦ããããã§ã¯ãªããã¨ã«é¢ä¿ãããã¾ããMeCabã¨ããããããä¸è¬çãªè©±ã§ãã以ä¸ã®ãããªèªèãä¸è¬çãã¨æããã¾ãã ã¨ããã®ããä¸çªåºã使ããã¦ããã§ãããèªç¶è¨èªå¦çæè¡ã¯å½¢æ ç´ è§£æ(åèªåãã¡æ¸ããã¨è¨ã£ãã»ããããã®ãããããªã)ã§ãããããããã¯ç¾å¨99%ãããã®ç²¾åº¦ã«ãªã£ã¦ãã¦ããã§ã«äººéãããããéãã«é«ç²¾åº¦ã§è¡ããã®ã ããããã ãé«ã精度ãåºããã®ã¯æ°èè¨äºãç¸æã«ããã¨ãã ãã§ãã£ã¦ãããã¯æ°èè¨äºãã³ã¼ãã¹ã¨ãã¦ç¨ããæ©æ¢°å¦ç¿ã«ããå½¢æ ç´ è§£
Overview The following information is meant to provide documentation on how others can recreate the benchmark trials used in our SIGMOD 2009 paper. Our experiments were conducted on a 100-node cluster at the University of Wisconsin-Madison; each node had a single 2.40 GHz Intel Core 2 Duo processor running 64-bit Red Hat Enterprise Linux 5 (kernel version 2.6.18) with 4GB RAM and two 250GB SATA-I
æé©ååé¡ã«ããã¦ãæé©å対象ã®å¤æ°ãæåã¯ç©ºã«åæåãã¦ã颿°å¤ã«ãã£ã¨ãå¹ããããªå¤æ°ããé ã«æé©å対象ã«Greedyã«å ãã¦ããæ¹æ³ã¯å¤æ°ã®æ°ãé常ã«å¤ãå ´åï¼å ¨ã¦ã®é¨åæååã«ç¹å¾´ã対å¿ãããªã©ãããããåæã§ããªããããå¤ãå ´åãªã©ï¼ã«æå¹ã§ãã 詳細ãªä¸èº«ã¯éãã¾ãããgrafting, column generation, cutting planeã¨ãããã®æ çµã¿ã«å½ã¦ã¯ã¾ã«ã¨æãã¾ãã ããã§ã®ãã¤ã³ãã¯ãå¹ããããªå¤æ°ããå¹ççã«æ±ãããã¨ãã§ããããå§åçã«éãæé©åã§ããããã«ãªããã¨ã§ããå¥åéã§ãã¼ã¿ãã¤ãã³ã°ã®ææ³ã ã¨ããä¸é/ä¸éã ã¨ããã¼ã¿æ§é ã¨ãä½ãæãæã£ã¦ãã人ã¯ããã²ãã£ã¬ã³ã¸ãã¦ã¿ã¦ãã ããã ã§ãç§ããã£ã¦ã¾ããã¨ããå®£ä¼ ã»ç¹å¾´ï¼å¤æ°ï¼ãææ¸ä¸ã®å ¨ã¦ã®é¨åæååã«å¯¾å¿ããå ´å "Text Categorization with All Sub
ã©ã³ãã³ã°
ã©ã³ãã³ã°
ã¡ã³ããã³ã¹
ãªãªã¼ã¹ãé害æ å ±ãªã©ã®ãµã¼ãã¹ã®ãç¥ãã
ææ°ã®äººæ°ã¨ã³ããªã¼ã®é ä¿¡
å¦çãå®è¡ä¸ã§ã
j次ã®ããã¯ãã¼ã¯
kåã®ããã¯ãã¼ã¯
lãã¨ã§èªã
eã³ã¡ã³ãä¸è¦§ãéã
oãã¼ã¸ãéã
{{#tags}}- {{label}}
{{/tags}}