IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 7 of 7  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2012-06-21
11:00		 Hokkaido Hokkaido University Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees
Tatsuya Akutsu, Takeyuki Tamura (Kyoto Univ.), Daiji Fukagawa (Doshisha Univ.), Atsuhiro Takasu (NII) COMP2012-15		 This report presents efficient exponential time algorithms for the unordered tree edit distance problem, which is known ... [more] COMP2012-15
pp.25-31
DE 2009-07-28
11:00		 Hyogo Kobe fashion mart Maximal Metric Margin Partitioning for Similarity Search Index
Hisashi Kurasawa (Univ. of Tokyo), Daiji Fukagawa, Atsuhiro Takasu, Jun Adachi (NII) DE2009-3		 A fundamental issue that confronts the development of an index for similarity searches in metric spaces is how to divide... [more] DE2009-3
pp.13-18
COMP 2009-06-29
14:05		 Hokkaido Hokkaido University Approximating Edit Distance of Unordered Trees of Bounded Height
Daiji Fukagawa (NII), Tatsuya Akutsu (Kyoto Univ.), Atsuhiro Takasu (NII) COMP2009-22		 The edit distance problem on two unordered trees is known to be MAX SNP-hard. In this paper, we present an approximation... [more] COMP2009-22
pp.31-36
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
COMP 2006-05-24
13:00		 Fukuoka Kyushu Institute of Technology Approximating Tree Edit Distance Through String Edit Distance
Tatsuya Akutsu (Kyoto Univ.), Daiji Fukagawa, Atsuhiro Takasu (NII) 		We present a method to transform an ordered and rooted tree of bounded degree into a string, where it is done by computi... [more] COMP2006-12
pp.17-24
COMP 2005-04-18
15:15		 Hyogo Kwansei Gakuin Univ. On the Complexity of Inferring a Graph from Path Frequency
Tatsuya Akutsu, Daiji Fukagawa (Kyoto Univ.) 		We consider the problem of inferring a graph (and a sequence) from the numbers of occurrences of vertex-labeled paths, w... [more] COMP2005-7
pp.49-55
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
 Results 1 - 7 of 7  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan