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 - 20 of 29  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2023-12-22
Miyazaki Miyazaki Univ. Machinaka Campus Uniform deployment of mobile robots with restricted views in path graphs
Kazuki Hasegawa, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2023-26
We consider the uniform deployment of mobile robots on path graphs.The view each robot can observe is restricted in the ... [more] COMP2023-26
COMP, IPSJ-AL 2023-05-11
Hokkaido Hokkaido University Parameterized Complexity of Shortest Path Most Vital Edges Problem
Yuto Ashida, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2023-6
Given an undirected graph $G$, vertices $s,t$ of $G$,and the number of removal edges $d$,the shortest paths most vital e... [more] COMP2023-6
COMP 2022-12-06
Ehime Ehime Univ. Media Hall A Fast (1+epsilon)-Approximating Algorithm for Single Source Replacement Path Problem
Kaito Harada, Naoki Kitamura, Taisuke Izumi, Toshimitsu masuzawa (Osaka Univ.) COMP2022-28
Let $G$ be any weighted undirected graph of $n$ vertices and $m$ edges, and $s$ be an arbitrary source vertex in $G$. In... [more] COMP2022-28
COMP, IPSJ-AL 2022-05-19
Online Online On Time Complexity of Distributed Minimum Spanning Tree Construction in the broadcast-CONGEST model for Restricted Graph Classes
Narumi Shigekiyo, Toshimitsu Masuzawa, Taisuke Izumi (Osaka Univ.) COMP2022-5
Broadcast-CONGEST is a variant of CONGEST, the standard computational model for distributed graph algorithms, with the r... [more] COMP2022-5
COMP, IPSJ-AL 2022-05-20
Online Online Computational Power of A Memoryless Mobile Agent in Undirected Rings
Taichi Inoue, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2022-8
We consider the system where a single mobile agent is deployed in an anonymous, oriented, and undirected ring of $n$ ver... [more] COMP2022-8
COMP, IPSJ-AL 2021-05-07
Online Online Exploration of dynamic graphs by the minimum number of agents
Shunsuke Iitsuka (Osaka Univ.), Yuichi Sudo (Hosei Univ.), Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2021-3
We consider the collaborative exploration of dynamic graphs by multiple agents, where dynamic graphs are defined as the ... [more] COMP2021-3
COMP, IPSJ-AL 2021-05-07
Online Online A self-stabilizing 1-minimal independent dominating set algorithm based on loop composition
Yuto Taniuchi (Osaka Univ.), Yuichi Sudo (Hosei Univ.), Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.) COMP2021-4
We consider the 1-minimal independent dominating set (1-MIDS) problem: given a connected graph $G=(V,E)$, our goal is to... [more] COMP2021-4
COMP, IPSJ-AL 2018-05-25
Aichi Nagoya Institute of Technology Fast Aggregation in Probabilistic Population Protocols
Ryota Eguchi, Taisuke Izumi (Nagoya Inst. of Tech.) COMP2018-6
In this paper, we propose a new aggregation algorithm in probabilistic population protocol model with a base station. Sp... [more] COMP2018-6
IT 2015-11-24
Okayama Shimoden Hotel [Invited Talk] A Short Introduction to Communication Complexity
Taisuke Izumi (NITECH) IT2015-44
Communication Complexity is a theory to reveal the necessary number of bits
exchanged among serveral parties for comput... [more]
COMP 2015-04-23
Miyagi   On Complexity of Loosely-Stabilizing Leader Election in Population Protocol Models
Taisuke Izumi, Kenji Hata (NITECH) COMP2015-5
 [more] COMP2015-5
COMP 2014-03-10
Tokyo   On Complexity of Distributed Diameter Approximation
Taisuke Izumi (Nagoya Inst. of Tech.), Roger Wattenhofer (ETH Zurich) COMP2013-69
 [more] COMP2013-69
COMP 2013-12-20
Okinawa Okinawa Industry Support Center On Enumerating All Maximal Cliques in Unit Disk Graphs
Daisuke Suzuki, Taisuke Izumi (Nagoya Inst. of Tech.) COMP2013-40
This paper considers the problem of enumerating all maximal cliques in unit disk graphs, which is a plausible setting fo... [more] COMP2013-40
COMP, IPSJ-AL 2013-05-18
Hokkaido Otaru University of Commerce On parallel complexity of MapReduce computation
Koichi Wada (Hosei Univ.), Taisuke Izumi (Nagoya Inst. of Tech.) COMP2013-17
 [more] COMP2013-17
COMP 2012-09-03
Tokyo Hosei University A New Direction for Counting Perfect Matchings
Taisuke Izumi, Tadashi Wadayama (Nagoya Inst. of Tech.) COMP2012-33
We present a new exact algorithm for counting
perfect matchings, which relies on neither inclusion-exclusion
princip... [more]
COMP 2011-12-16
Aichi Nagoya Univ. Relationship Between Coding Theory and Counting Perfect Matchings
Taisuke Izumi, Tadashi Wadayama (NITech) COMP2011-37
Counting perfect matchings is known as one of the hard problems to obtain
exact results, which is proven to be \#P-comp... [more]
COMP 2011-03-09
Tokyo Chuo Univ. Communication-Efficient Broadcast on Markovian Evolving Graphs
Kei Matsubara, Taisuke Izumi, Koichi Wada (NIT) COMP2010-48
The design of efficient distributed algorithms working on dynamic networks
recently receives much attention. The Marko... [more]
IBISML 2010-11-05
Tokyo IIS, Univ. of Tokyo [Poster Presentation] A Study on Multiple Multivariate Two-Sample Test for Gene Set Analysis using MST-based SVM Path-Following
Yuta Ishikawa, Kota Isobe, Masayuki Karasuyama, Taisuke Izumi, Ichiro Takeuchi (NIT) IBISML2010-88
Microarray technology enables us to measure expression levels of thousands of genes simultaneously. We consider how to f... [more] IBISML2010-88
DC 2009-02-16
Tokyo   A method for generating defect oriented test patterns for combinational circuits
Hiroshi Takahashi, Yoshinobu Higami, Taisuke Izumi, Takashi Aikyo, Yuzo Takamatsu (Ehime Univ.) DC2008-73
With shrinking of LSIs, the diversification of defective mode due to defects becomes a critical issue.
Therefore, the ... [more]
COMP 2008-09-11
Aichi Nagoya Inst. of Tech. Convergence problem of Mobile Robots with Uniformly-Inaccurate Sensors
Kenta Yamamoto, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) COMP2008-29
(To be available after the conference date) [more] COMP2008-29
COMP 2008-09-11
Aichi Nagoya Inst. of Tech. On Gathering Problem in a Ring for 2n Autonomous Mobile Robots
Kotaro Haba, Taisuke Izumi, Yoshiaki Katayama, Nobuhiro Inuzuka, Koichi Wada (NIT) COMP2008-30
This paper studies a gathering problem in a ring for $2n$ autonomous mobile robots. In [1] it is shown that gathering is... [more] COMP2008-30
 Results 1 - 20 of 29  /  [Next]  
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