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 - 13 of 13  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
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
WIT, SP, ASJ-H, PRMU 2015-06-19
14:25		 Niigata   Analysis of mental model formed by confused knowledge of novice learners in pointer learning of C language
Yuki Narisawa, Shunichi Yonemura (SIT) PRMU2015-63 SP2015-32 WIT2015-32		 Learning programming with C language is popular, but novice learners give up studies in pointer of C language. According... [more] PRMU2015-63 SP2015-32 WIT2015-32
pp.181-186
WIT 2014-12-11
17:10		 Tokyo AIST Tokyo Waterfront Study on mental model acquisition of novice learners in pointer learning of C language.
Yuki Narisawa, Shunichi Yonemura (Shibaura Inst. of Tech.) WIT2014-71		  [more] WIT2014-71
pp.103-108
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-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 2007-04-26
16:25		 Kyoto Katsura Campus, Kyoto University Suffix Array Based Computation of Substring Equivalence Classes
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2007-9		 This paper considers enumerating substring equivalence classes introduced by Blumer et al. They
used the equivalence cl... [more]		 COMP2007-9
pp.63-70
 Results 1 - 13 of 13  /   
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