|
|
|
|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
|
| Search Results: Conference Papers |
| Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
|
| Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
| 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 |
| ISEC, IPSJ-CSEC, SITE |
2005-07-21
09:30 |
Iwate |
Iwate Prefectural University |
A Proposal of Worm Detection System by Taking a Statistics of Series of Packets to Honeypot
Maki Kataoka, Yumiko Ishige (NTT Data Corporation), Nobutaka Mantani, Humiharu Ohashi (National Police Agency) |
A worm detection system tells us when an unknown worm occurs as well as its attributes. In the proposed system, traffic ... [more] |
ISEC2005-9 SITE2005-7
pp.1-6 |
| 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 |
|
|
|
|
|
[Return to Top Page]
[Return to IEICE Web Page]
|