| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| MSS, CAS, IPSJ-AL [detail] | 2016-11-25 09:50 |
Hyogo | Kobe Institute of Computing | On the Complexity of Finding a Largest Common Subtree of Trees Hiroki Katsumata, Satoshi Tayu, Shuichi Ueno (Tokyo Tech)  CAS2016-70 MSS2016-50 |
The largest common subtree problem (LCST) is to find a tree with the maximum number of edges that is a subtree of all th... [more] | CAS2016-70 MSS2016-50 pp.89-92 |
| DE | 2008-09-21 17:00 |
Fukushima | [Poster Presentation]
Syntax-based XML Subtree Segmentation, Matching and Integration Wenxin Liang (JST/Tokyo Inst. of Tech.), Haruo Yokota (Tokyo Inst. of Tech.) DE2008-33 |
With the exponential increase in the amount of XML data on the Internet, XML subtree segmentation, matching and integrat... [more] | DE2008-33 pp.7-8 |
|
| COMP | 2008-05-13 15:20 |
Fukuoka | Kyushu Sangyo University | Improved approximation of the Largest common Sub-tree of Two Unordered Trees of Bounded Height Tatsuya Akutsu (Kyoto Univ.), Daiji Fukagawa, Atsuhiro Takasu (NII) COMP2008-13 |
Finding similarities in tree structured data is important for such areas as computational biology, XML databases and ima... [more] | COMP2008-13 pp.37-42 |
| DE, DC | 2007-10-15 11:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg | Consideration of Page-Splitting Methods in a Fat-Btree for Distributing PostgreSQL Yuta Namiki (Tokyo Tech), Kota Kanbe (Future Architect), Dai Kobayashi, Haruo Yokota (Tokyo Tech) DE2007-115 DC2007-12 |
We are trying to construct a shared-nothing parallel database system using PostgreSQL and a Fat-Btree, a parallel B-tree... [more] | DE2007-115 DC2007-12 pp.1-6 |
| DE | 2007-07-04 08:25 |
Miyagi | Akiu hot springs (Sendai) | An approach of using a parallel B-tree structure, Fat-Btree, in PostgreSQL for distributed retrieval Yuta Namiki (Tokyo Tech), Kota Kanbe (Future Architect), Dai Kobayashi (Tokyo Tech./JSPS), Haruo Yokota (Tokyo Tech) DE2007-101 |
Parallel database systems have been developed to support the performance demands on large databases. To enable distribu... [more] | DE2007-101 pp.473-478 |
| PRMU, DE | 2007-06-28 11:00 |
Hokkaido | Hokkaido Univ. | Finding of Frequent Similar Subtrees in Tree-Structured Data Hisashi Tosaka, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) DE2007-2 PRMU2007-28 |
We study a novel problem of mining subtrees with frequent occurrence of similar subtrees, and propose an efficient algo... [more] |
DE2007-2 PRMU2007-28 pp.7-12 |
| DE | 2006-07-14 10:25 |
Niigata | HOTEL SENKEI | A Concurrency Control Method Using the B-link on the Fat-Btree Tomohiro Yoshihara, Dai Kobayashi (Tokyo Tech), Ryo Taguchi (NHK), Haruo Yokota (Tokyo Tech) |
The B-link can achieve excellent concurrency control, which uses links to chain all nodes at each level together. In the... [more] | DE2006-110 pp.109-114 |
| COMP | 2004-09-17 13:45 |
Hokkaido | Hokkaido University | Fast Algorithms for Comparison of Similar Unordered Trees Daiji Fukagawa, Tatsuya Akutsu (Kyoto Univ.) |
We present fast algorithms for computing the largest common subtree (LCST) and for computing optimal alignment when two ... [more] | COMP2004-30 pp.33-40 |
[Return to Top Page]