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 - 18 of 18  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2020-12-04
10:40
Online Online Efficient Construction of Cryptarithm Catalogues over DFA
Koya Watanabe, Diptarama Hendrian, Ryo Yoshinaka (Tohoku Univ.), Takashi Horiyama (Hokkaido Univ.), Ayumi Shinohara (Tohoku Univ.) COMP2020-20
A cryptarithm is a mathematical puzzle where given an arithmetic equation written with letters rather than numerals, a p... [more] COMP2020-20
pp.16-23
COMP 2019-12-13
10:50
Gunma Ikaho Seminar House, Gunma University An exact string matching algorithm based on the distances of q-gram occurrences
Satoshi Kobayashi, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara (Tohoku Univ.) COMP2019-33
Given a text $T$ of length $n$ and a pattern $P$ of length $m$, the exact string matching problem is a task to find all ... [more] COMP2019-33
pp.31-38
COMP 2016-03-14
13:30
Fukuoka   Longest Common Subsequence Problem for Numerical Sequences by using Order-Isomorphic-Substrings
Masatoshi Kurihara, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2015-38
The order-isomorphism can be used as a criteria for the similarity of numerical sequences. The order-preserving matching... [more] COMP2015-38
pp.11-20
COMP 2015-09-01
11:00
Nagano   Generalization of Efficient Implementation of Compression by Substring Enumeration -- Finite Alphabet and Explicit Phase Awareness --
Shumpei Sakuma, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2015-18
CSE (Compression by Substring Enumeration), a lossless universal compression scheme was introduced by Dub'e and Beaudoin... [more] COMP2015-18
pp.13-20
COMP 2014-09-02
10:00
Aichi Toyohashi University of Technology Memory-Efficient Indexing Structure for Permuted Pattern Matching on Multi-Track Strings
Takashi Katsura, Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2014-15
A multi-set of $N$ strings of length $n$ is called a multi-track string.
The permuted pattern matching is the problem t... [more]
COMP2014-15
pp.1-8
COMP 2013-12-21
15:20
Okinawa Okinawa Industry Support Center On the minimum consistent DFA problem for prefix samples
Kaori Ueno (Tohokui Univ.), Shinichi Shimozono (Kyushu Inst. of Tech.), Kazuyuki Narisawa, Ayumi Shinohara (Tohokui Univ.) COMP2013-57
We study the computational complexity of nding the minimum deterministic nite automaton (DFA) that is consistent with ... [more] COMP2013-57
pp.115-122
IBISML 2013-11-13
15:45
Tokyo Tokyo Institute of Technology, Kuramae-Kaikan [Poster Presentation] Sample Complexity Reduction in Reinforcement Learning by Transferred Transition and Reward Probability
Kouta Oguni, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) IBISML2013-54
Most existing reinforcement learning algorithms are not very efficient in real environmental problems. Because, they hav... [more] IBISML2013-54
pp.139-146
COMP 2013-10-18
11:50
Aichi Nagoya Institute of Technology Efficient Algorithm and Coding for Higher-Order Compression
Kazuya Yaguchi (Tohoku Univ.), Naoki Kobayashi (Univ. of Tokyo), Ayumi Shinohara (Tohoku Univ.) COMP2013-34
Higher-order compression is a scheme for compressing data in the form of functional programs that generate the data.
Th... [more]
COMP2013-34
pp.13-20
COMP 2013-04-24
10:35
Hyogo Kobe University Approximate Permuted Pattern Matching and Indexing Structure for Multi-Track Data
Hiroyuki Ota, Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2013-2
A multi-track data is a multi-set of sequences.
The permuted pattern matching problem is, given a multi-track text and ... [more]
COMP2013-2
pp.9-16
COMP 2013-04-24
11:10
Hyogo Kobe University Analysis of the Maximum Sum of Exponents of Runs in Strings
Kazuhiko Kusano, Ryosuke Okuta, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2013-3
A run in a string is a periodic substring which can not be extendable neither to the left nor right with the same period... [more] COMP2013-3
pp.17-24
COMP 2012-12-10
10:05
Fukuoka Kyushu University Constructing Position Heaps for Various Pattern Matching
Yuhei Otomo, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2012-44
 [more] COMP2012-44
pp.7-14
COMP 2012-10-31
13:30
Miyagi Tohoku University Pattern matching on compressed text using smaller space
Takao Aihara, Ayumi Shinohara, Kazuyuki Narisawa (Tohoku Univ.) COMP2012-37
In this paper, we propose a randomized algorithm for pattern matching on strings represented by straight-line programs (... [more] COMP2012-37
pp.17-24
COMP 2012-09-03
09:30
Tokyo Hosei University Permuted Pattern Matching and Indexing Structure for Multi-Track Strings
Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.), Hideo Bannai, Shunsuke Inenaga (Kyushu Univ.) COMP2012-26
We propose a new variant of pattern matching on a multi-set of
strings, or multi-tracks, called permuted-matching,
tha... [more]
COMP2012-26
pp.1-8
COMP 2010-04-22
14:35
Shiga Ritusmeikan University, Biwako-Kusatsu Campus Transposition Invariant Fully Compressed Pattern Matching Algorithm
Wataru Matsubara, Ayumi Shinohara (Tohoku Univ.) COMP2010-6
Transposition invariant pattern matching is the problem of matching given text and pattern to find the occurrence in the... [more] COMP2010-6
pp.39-45
COMP 2010-04-22
15:10
Shiga Ritusmeikan University, Biwako-Kusatsu Campus Elementary Formal System with Nonterminal Symbols
Tomohiko Koide, Ayumi Shinohara (Tohoku Univ.) COMP2010-7
Elementary Formal Systems (EFS) are logic programs over strings, and
they are useful to describe various language class... [more]
COMP2010-7
pp.47-54
COMP 2009-03-02
09:45
Tokyo Tokyo Institute of Technology An Algorithm to Test Square-Freeness of BSLP-Compressed Strings
Wataru Matsubara (Tohoku Univ.), Shunsuke Inenaga (Kyushu Univ.), Ayumi Shinohara (Tohoku Univ.) COMP2008-55
Balanced Straight line programs(BSLPs) is one of the most powerful and general compression schemes. An BSLP is a context... [more] COMP2008-55
pp.9-16
COMP 2008-03-10
15:15
Kanagawa   Polynomial time algorithms for computing longest common substring and all palindromes from compressed strings
Wataru Matsubara (Tohoku Univ.), Shunsuke Inenaga (Kyushu Univ.), Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto (Tohoku Univ.) COMP2007-63
\emph{Straight line programs} (\emph{SLPs}) is one of the most powerful and general compression schemes. An SLP is a con... [more] COMP2007-63
pp.55-62
COMP 2007-04-26
15:50
Kyoto Katsura Campus, Kyoto University Repetitions in the infinite n-bonacci word
Takahito Sasaki, Tsugutoyo Osaki, Akira Ishino, Ayumi Shinohara (Tohoku Univ.) COMP2007-8
The Fibonacci word $F_{m}$ is defined as the concatenation of the preceding two Fibonacci words $F_{m-1}$ and $F_{m-2}$.... [more] COMP2007-8
pp.55-61
 Results 1 - 18 of 18  /   
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