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 - 17 of 17  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2023-10-24
13:30
Aichi Nagoya Univ. Venture Business Lab. An algorithm for the secure total domination problem in proper interval graphs
Toru Araki, Yasufumi Aita (Gunma Univ.) COMP2023-11
A subset $S$ of vertices of $G$ is a total dominating set if, for any vertex $v$, there is a vertex in $S$ adjacent to $... [more] COMP2023-11
pp.1-8
COMP 2023-03-02
14:45
Tokyo Ochanomizu University Correcting the algorithm for a minimum secure dominating set of proper interval graphs
Toru Araki, Ryuya Saito (Gunma Univ.) COMP2022-36
In [A simple algorithm for secure domination in proper interval graphs, Discrete Applied Mathematics 260 (2019) 289--293... [more] COMP2022-36
pp.16-20
NC, IBISML, IPSJ-BIO, IPSJ-MPS [detail] 2021-06-28
15:20
Online Online Predictive Graph Mining using Graphs with Interval Attributes
Hinata Asahi, Masayuki Karasuyama (NIT) NC2021-6 IBISML2021-6
Graphs have been widely used to represent structured data such as molecular data and traffic networks. In this paper, we... [more] NC2021-6 IBISML2021-6
pp.39-46
SP, EA, SIP 2020-03-03
09:00
Okinawa Okinawa Industry Support Center
(Cancelled but technical report was issued)
[Poster Presentation] Comparison of Neural Network Models for Detection of Spatiotemporal Abnormal Intervals in Epileptic EEG
Kosuke Fukumori (TUAT), Noboru Yoshida (Juntendo Univ.), Toshihisa Tanaka (TUAT) EA2019-156 SIP2019-158 SP2019-105
Epilepsy is a chronic brain disease, and the detection of abnormal waveforms by scalp electroencephalography (EEG) is an... [more] EA2019-156 SIP2019-158 SP2019-105
pp.319-323
COMP 2019-09-02
16:00
Okayama Tsushima Campus, Okayama University Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams
Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-16
This research proposes algorithms that construct compressed data
structures, called zero-suppressed binary decision dia... [more]
COMP2019-16
p.33
COMP 2019-03-18
09:55
Tokyo The University of Tokyo *
Sumiko Harasawa, Ryuhei Uehara (JAIST) COMP2018-44
(To be available after the conference date) [more] COMP2018-44
pp.9-16
MBE, NC
(Joint)
2018-03-13
10:25
Tokyo Kikai-Shinko-Kaikan Bldg. Estimation of sleep position change and sleep stages using sheet-type vibration sensors
Megumi Nakamura, Shion Yamagata, Takamasa Yoshida, Nobuyuki Terada (Toyo Univ.) MBE2017-90
To easily estimate sleep position change and sleep stages on the bed, we measured physical vibrations using sheet-type v... [more] MBE2017-90
pp.57-60
COMP 2017-10-27
15:50
Tokyo   Exploration of dynamic tori by mobile agents
Tsuyoshi Gotoh, Yuichi Sudo (Osaka Univ), Fukuhito Ooshita (NAIST), Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ) COMP2017-25
Mobile agents (agents) are entities which can move autonomously in a networked system and execute actions at nodes they ... [more] COMP2017-25
pp.37-44
COMP 2017-08-18
15:55
Aomori   Secure Domination in Proper Interval Graphs
Toru Araki, Hiroka Miyazaki (Gunma Univ.) COMP2017-18
A subset $S$ of vertices in a graph $G$ is a secure dominating set of $G$ if $S$ is a dominating set of $G$ and, for eac... [more] COMP2017-18
pp.41-46
COMP 2015-04-23
13:10
Miyagi   Algorithms for Dominating Set Reconfiguration Problem
Arash Haddadan (Univ. of Waterloo), Takehiro Ito (Tohoku Univ.), Amer E. Mouawad, Naomi Nishimura (Univ. of Waterloo), Hirotaka Ono (Kyushu Univ.), Akira Suzuki (Tohoku Univ.), Youcef Tebbal (Univ. of Waterloo) COMP2015-1
Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$
whose cardinalities are at most a given th... [more]
COMP2015-1
pp.1-7
COMP 2014-04-24
10:20
Miyagi Tohoku University Thin strip graphs
Yota Otachi (JAIST), Akitoshi Kawamura (Univ. of Tokyo), Hidehiro Shinohara (Tohoku Univ.), Takashi Hayashi, Koichi Yamazaki (Gunma Univ.) COMP2014-1
A unit disk graph is a emph{$c$-strip graph} if it has a unit disk representation in which all centers of the unit disks... [more] COMP2014-1
pp.1-4
MSS, CAS, IPSJ-AL [detail] 2013-11-07
09:55
Iwate   A Note on Two-Directional Orthogonal Ray Graphs and Related Graphs
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2013-65 MSS2013-44
An orthogonal ray graph is an intersection graph of horizontal and vertical rays (half-lines) in the plane. An orthogona... [more] CAS2013-65 MSS2013-44
pp.99-104
COMP 2010-10-15
14:40
Miyagi Tohoku Univ. Bipartite powers of interval bigraphs
Yoshio Okamoto (Tokyo Inst. of Tech.), Yota Otachi (Tohoku Univ.), Ryuhei Uehara (JAIST) COMP2010-36
The notion of graph powers is a well-studied topic in graph theory and its applications. In this paper, we investigate a... [more] COMP2010-36
pp.35-39
COMP 2007-09-20
13:50
Aichi   Bandwidth of Bipartite Permutation Graphs
Ryuhei Uehara (JAIST) COMP2007-36
The bandwidth problem is to find a linear layout of vertices in a graph
in such way that minimizes the maximum distance... [more]
COMP2007-36
pp.29-34
COMP 2007-06-29
14:15
Hokkaido Hokkaido University Simple efficient algorithm for MPQ-tree of an interval graph
Toshiki Saitoh, Masashi Kiyomi, Ryuhei Uehara (JAIST) COMP2007-24
An MPQ-tree is an informative data structure for an interval graph. We propose a simple algorithm that constructs an MPQ... [more] COMP2007-24
pp.49-54
IT, WBS, ISEC 2005-03-18
15:55
Kyoto Kyoto Univ. Variable Data-length Encryption Using Arithmetic Operations
Takeshi Tounai, Hisashi Suzuki (Chuo Univ)
This article proposes an algorithm which adaptive arithmetic coding is applied to for an encryption, which converts any ... [more] IT2004-87 ISEC2004-143 WBS2004-202
pp.89-94
COMP 2004-12-10
14:30
Chiba Toho University Interval bigraphs are unit grid intersection graphs
Yota Otachi, Koichi Yamazaki (Gunma Univ.)
An interval bigraph is the intersection graph of two families of intervals on the real line such that vertices are adjac... [more] COMP2004-56
pp.21-23
 Results 1 - 17 of 17  /   
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