| 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 # | |
| COMP | 2015-09-01 12:45 |
Nagano | [Invited Talk]
Regular Expressions and Their applications
-- Finite Automata to Pattern Matching -- Hiroaki Yamamoto (Shinsyu Univ.)  COMP2015-19 |
[more] | COMP2015-19 pp.21-26 |
|
| CAS | 2015-01-30 10:25 |
Tokyo | Tokyo Metropolitan University (Akihabara Satellite Campus) | Fast Search Method of Isomorphic Polygons Using Geometric Invariant Feature Value
-- Polygon Search Method Applying Geometric Hashing -- Shuji Shoji (Yamagata Univ.), Hiroaki Yamamoto (Shinshu Univ.), Akio Koyama (Yamagata Univ.) CAS2014-113 |
A large number of isomorphic polygons are included in design data of large scale integrated circuit. Fast searching and ... [more] | CAS2014-113 pp.43-48 |
| COMP | 2013-12-21 14:30 |
Okinawa | Okinawa Industry Support Center | A New Automaton Construction using Prefixes and Suffixes of Regular Expressions Hiroaki Yamamoto (Shinshu Univ.) COMP2013-55 |
[more] | COMP2013-55 pp.99-106 |
| COMP | 2012-09-03 10:05 |
Tokyo | Hosei University | Bit-Parallel Algorithms for Finding All Substrings Matching a Regular Expression Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano National College of Tech.) COMP2012-27 |
This paper is concerned with the following regular expression searching problem which, given a regular expression $r$ ... [more] |
COMP2012-27 pp.9-16 |
| COMP | 2011-12-16 09:30 |
Aichi | Nagoya Univ. | A compact DFA representation using dual position automata Hiroaki Yamamoto, Shogo Nakamura (Shinshu Univ.) COMP2011-36 |
This paper introduces an automaton model called {\em a dual position automaton} (a dual PA), and then gives a bit-paral... [more] |
COMP2011-36 pp.1-7 |
| COMP, IPSJ-AL | 2011-09-06 14:50 |
Hokkaido | Hakodate City Central Library | Extended Pseudo-tree Pattern Matching with labels of strings Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano NCT) COMP2011-25 |
Given two unordered labeled trees P and T , the tree pattern matching problem for unordered labeled trees is to find all... [more] | COMP2011-25 pp.53-60 |
| COMP | 2010-09-29 14:05 |
Niigata | Nagaoka Univ. of Tech. | A method to construct a compact automata from regular expressions Toshinori Sakata, Hiroaki Yamamoto (Shinshu Univ.) COMP2010-28 |
[more] | COMP2010-28 pp.31-38 |
| COMP | 2008-10-10 09:00 |
Miyagi | Tohoku Univ. | Bit-Parallel Tree Pattern Matching Algorithms for Trees with Restricted Labels Hiroaki Yamamoto (Shinshu Univ.), Daichi Takenouchi (NTT-AT) COMP2008-34 |
[more] | COMP2008-34 pp.1-8 |
| PRMU | 2008-02-22 13:45 |
Ibaraki | Univ. of Tsukuba | A study for high performance character extraction from color scene images Masanori Wakabayashi, Keiichiro Shirai, Masayuki Okamoto, Hiroaki Yamamoto (Shinshu Univ.) PRMU2007-240 |
This paper describes a robust method for extracting character strings from scene images.In our previous method, characte... [more] | PRMU2007-240 pp.149-154 |
| COMP | 2007-06-29 16:35 |
Hokkaido | Hokkaido University | On an Efficient Implementation of a DFA-based Algorithm for the Exetended Regular Expression Membership and Search Problems Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano NCT) COMP2007-29 |
This paper addresses the following extended regular expression (EREs for short, that is, regular expressions with inte... [more] |
COMP2007-29 pp.85-92 |
| SS | 2005-06-23 15:15 |
Nagano | Shinshu Univ. Ohta-Kokusai-Kinenkan | An extended regular expression matching System which can dynamically define operations Yoshifumi Okada, Hiroaki Yamamoto (Shinshu Univ.) |
[more] | SS2005-16 pp.27-32 |
| COMP | 2005-05-20 16:40 |
Fukuoka | Kyushu Univ. | Experimental Evaluation of Automata-Based Extended Regular Expression Matching Algorithms Hiroaki Yamamoto (Shinshu Univ.) |
[more] | COMP2005-17 pp.59-66 |
| COMP | 2004-09-17 11:00 |
Hokkaido | Hokkaido University | Faster bit-parallel algorithms for translating regular expressions into NFAs Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano National College of Tech), Masayuki Okamoto (Shinshu Univ.) |
[more] | COMP2004-27 pp.9-16 |
[Return to Top Page]