| 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 # | |
| KBSE | 2023-03-17 14:10 |
Hiroshima | JMS ASTERPLAZA (Primary: On-site, Secondary: Online) |
Analyzing Business Processes by Automatically Detecting KPI Thresholds Based on Trace Variants Taro Takei, Hiroki Horita (Ibaraki Univ.)  KBSE2022-66 |
One method for analyzing complex business processes is to filter event logs by KPI thresholds to extract only specific p... [more] | KBSE2022-66 pp.73-78 |
| DE, IPSJ-DBS, IPSJ-IFAT | 2019-09-10 15:25 |
Tokyo | Kogakuin University | Calculating typicality of cooking procedures for extracting recipe arrangement Tatsuya Oonita, Daisuke Kitayama (Kogakuin Univ.) DE2019-16 |
We are working on the extraction of basic recipes in order to form the basis for the arrangement extraction of recipes. ... [more] |
DE2019-16 pp.7-11 |
| 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 |
|
| HCGSYMPO (2nd) |
2014-12-17 - 2014-12-19 |
Yamaguchi | Kaikyo Messe Shimonoseki | Action name ontology derived from procedural structure mapping between the recipes with the same food category Yoko Yamakata (Kyoto Univ.), Shinji Imahori (Nagoya Univ.), Tetsuro Sasada, Shinsuke Mori (Kyoto Univ.) |
(To be available after the conference date) [more] | |
| ET | 2012-09-29 13:50 |
Okayama | Improvement of a Method for Estimating Updated Annotations' Position in a Web-Based Annotation Sharing System Keita Kobayashi, Hisayoshi Kunimune, Masaaki Niimura (Shinshu Univ.) ET2012-33 |
A web-based annotation system we are developing, which allows its users to annotate directly on web-based materials, est... [more] | ET2012-33 pp.27-32 |
|
| 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 |
| PRMU, FM | 2011-12-15 11:00 |
Shizuoka | Hamamatsu Campus, Shizuoka Univ. | Generic Object Recognition by Graph Structural Expression Takahiro Hori, Tetsuya Takiguchi, Yasuo Ariki (Kobe Univ.) PRMU2011-127 |
This paper describes a method for generic object recognition using graph structural expression. In recent years, generic... [more] | PRMU2011-127 pp.19-24 |
| 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 |
| 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 |
| PRMU, IE | 2008-03-11 09:50 |
Ishikawa | Silhouette Image Recognition by Edit Distance and Multidimesional Scaling Mingming Zhang, Shinichiro Omachi, Hirotomo Aso (Tohoku Univ.) IE2007-308 PRMU2007-292 |
Graph representations are usually used to classify silhouette images based on topological features. A main graph-matchin... [more] | IE2007-308 PRMU2007-292 pp.297-300 |
|
| PRMU | 2007-03-16 09:00 |
Okayama | Semantic news video indexing using the Web Hidenobu Nagata, Masashi Morimoto (NTT) |
This paper presents a novel methodology of semantic video indexing for broadcasts using the Web. Focusing on the co-... [more] |
PRMU2006-258 pp.19-24 |
|
| 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 |
| 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 |
[Return to Top Page]