Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
US |
2019-02-22 16:50 |
Kanagawa |
|
Three dimensional extension of blood vessel network by combining multiple ultrasound volumes from different directions Ikumu Yasuda, Takuya Katai, Kosuke Watanabe, Kansai Okadome (Tokyo Univ. A&T), Yoshihiro Edamoto (Higashi-Saitama Hospital), Kohji Masuda (Tokyo Univ. A&T) US2018-119 |
In this study, we aim to reconstruct a wide range of blood vessel network by extending the ultrasound volume taken from ... [more] |
US2018-119 pp.57-60 |
MSS |
2016-03-03 15:00 |
Yamaguchi |
KAIKYO MESSE SHIMONOSEKI |
A Method of Weight Assignment to Phonetic Symbols for Generating Language Family Trees based on Basic Vocabulary Yuya Matsuura (Yamaguchi Univ.), Ren Wu (Yamaguchi Junior Coll.), Hiroshi Matsuno (Yamaguchi Univ.) MSS2015-73 |
As a method for estimating language genealogical relationship, generation of language family trees based on pronunciatio... [more] |
MSS2015-73 pp.33-36 |
KBSE |
2016-01-25 16:00 |
Tokyo |
|
Code clone detecting method based on the degree of tree structure similarity Ryota Ami, Hirohide Haga (Doshisha Univ.) KBSE2015-43 |
In this article we propose to combine these two methods to improve the efficient and accuracy of detecting code clones. ... [more] |
KBSE2015-43 pp.19-24 |
MSS |
2013-01-23 15:20 |
Osaka |
Osaka Int. Convention Center |
A Proposal of Similarity Evaluation for Ordered Trees
-- Application to Similarity Verification of C Language Programs -- Huricha Bao, Mitsuru Nakata, Qi-Wei Ge (Yamaguchi Univ.) MSS2012-56 |
In this paper,we deal with evaluation method of similarity of two given ordered trees. A similarity computation techniqu... [more] |
MSS2012-56 pp.61-64 |
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 |
IN, NS (Joint) |
2011-03-04 09:10 |
Okinawa |
Okinawa Convention Center |
An in-network spam filtering method using nearest neighbor search of edit distance Yosuke Tsukajima, Akihiro Nakao (Univ. of Tokyo) NS2010-244 |
Email has become an indispensable means for the communication in social life. However, a huge amount of spam has become ... [more] |
NS2010-244 pp.449-454 |
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 |
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 |
PRMU, DE |
2008-06-19 14:00 |
Hokkaido |
Otaru-Shimin-Kaikan |
A study on fast search of the nearest string in edit distance Hiroyuki Hanada, Mineichi Kudo (Hokkaido Univ.) DE2008-8 PRMU2008-26 |
The problem is finding the nearest string, measured by edit distance,
to a query string $q$ from a set $T$ of strings. ... [more] |
DE2008-8 PRMU2008-26 pp.41-46 |
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 |
2006-03-22 16:00 |
Tokyo |
The University of Electro-Communications |
Canonical Tree Representation of Distance Hereditary Graphs with Applications Ryuhei Uehara (JAIST), Takeaki Uno (NII) |
The class of distance hereditary graphs consists of
the isometric graphs.
That is, for each pair of vertices,
its d... [more] |
COMP2005-61 pp.31-36 |
PRMU, NLC |
2005-02-24 15:10 |
Tokyo |
|
Merging Shock Trees Using Alignable Mappings Tetsuji Kuboyama, Kilho Shin (Univ. of Tokyo), Tetsuhiro Miyahara (Hiroshima City Univ.) |
A shock tree is a very effective characterization for representing 2D shapes. Torsello and Hancock have proposed an unsu... [more] |
NLC2004-113 PRMU2004-195 pp.97-102 |
DE, DC |
2004-10-19 13:30 |
Tokyo |
Tokyo Institute of Technology |
Information Extraction from Web Pages Using a Tree Edit Distance Measure Tetsuji Kuboyama (Univ. of Tokyo), Tetsuhiro Miyahara (Hiroshima City Univ.) |
Recent research efforts on extracting information from Web pages have mainly focused on semi-automatic and automatic app... [more] |
DE2004-117 DC2004-32 pp.19-24 |
COMP |
2004-09-17 13:15 |
Hokkaido |
Hokkaido University |
Mapping Conditions for Alignment of Trees Tetsuji Kuboyama (Univ. of Tokyo), Akira Yasuhara (Tokyo Gakugei Univ.), Tetsuhiro Miyahara (Hiroshima City Univ.) |
A number of edit-based distance measures have been proposed to find a structural similarity between trees. Alignment of... [more] |
COMP2004-29 pp.25-32 |
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 |