| 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 | 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 |
| R | 2023-09-28 15:20 |
Fukuoka | (Primary: On-site, Secondary: Online) |
Polynomial Failure Models: Theory and Applications Tadashi Dohi, Hiroyuki Okamura (Hiroshima Univ.) R2023-41 |
In this paper we summarize two polynomial failure models, where the lifetime distributions are described by canonical po... [more] | R2023-41 pp.22-27 |
| RCC, ISEC, IT, WBS | 2023-03-14 13:25 |
Yamaguchi | (Primary: On-site, Secondary: Online) |
Signature scheme based on OSIDH Kohtaroh Aoyagi (TUT), Hiroki Minamide (NITTC), Koutarou Suzuki (TUT) IT2022-90 ISEC2022-69 WBS2022-87 RCC2022-87 |
Isogeny-based cryptography, post-quantum cryptography, is a cryptographic technique that has attracted attention because... [more] | IT2022-90 ISEC2022-69 WBS2022-87 RCC2022-87 pp.135-141 |
| 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 |
| EST | 2023-01-26 15:20 |
Okinawa | (Primary: On-site, Secondary: Online) |
Statistical Analysis of Multiconductor Non-Uniform Transmission Line with Variations in Line Height and Line gap using Polynomial Chaos Methods Yuto Hachiga, Yoshiki Kayano, Yoshio Kami, Fengchao Xiao (UEC) EST2022-85 |
Monte Carlo (MC) method, which is commonly used in a statistical analysis, can perform highly accurate calculations, but... [more] | EST2022-85 pp.58-63 |
| COMP | 2022-10-26 11:45 |
Fukuoka | Kyusyu Univ. Nishijin Plaza | Evacuation problems on grid networks with uniform transit time and uniform capacity Yuki Tokuni, Naoki Katoh, Junichi Teruyama, Yuya Higashikawa (Uoh) COMP2022-15 |
We consider the problem of finding the minimum time at which all supplies on a dynamic flow network can reach the demand... [more] | COMP2022-15 pp.7-13 |
| COMP | 2022-10-26 14:30 |
Fukuoka | Kyusyu Univ. Nishijin Plaza | Efficient Enumeration of Spanning Subgraphs in Planar Graphs with Edge Connectivity Constraints Yasuaki Kobayashi (Hokkaido Univ.), Kazuhiro Kurita (Nagoya Univ.), Kunihiro Wasa (Hosei Univ.) COMP2022-17 |
In this paper, we address an efficient enumeration of spanning subgraphs in planar graphs with edge-connected constraint... [more] | COMP2022-17 pp.21-28 |
| R | 2022-10-07 14:25 |
Fukuoka | (Primary: On-site, Secondary: Online) |
A note on Polynomial Software Reliability Models Siqiao Li, Tadashi Dohi, Hiroyuki Okamura (Hiroshima Univ.) R2022-35 |
In this article, we propose two novel non-homogeneous Poisson process (NHPP)-based software reliability models (SRMs), c... [more] | R2022-35 pp.19-24 |
| COMP, IPSJ-AL | 2022-05-19 13:00 |
Online | Online | Transportation Problem on a Graph Tetsuo Asano (Kanazawa Univ.) COMP2022-1 |
We consider a transportation problem defined on a node-weighted undirected graph. Weight is positive if the amount of c... [more] | COMP2022-1 pp.1-8 |
| VLD, HWS [detail] | 2022-03-07 11:25 |
Online | Online | Design and Measurement of Crypto Processor for Post Quantum Cryptography CRYSTALS-Kyber Taishin Shimada, Makoto Ikeda (Univ. of Tokyo) VLD2021-81 HWS2021-58 |
CRYSTALS-Kyber is one of the public key cryptosystems being considered as a public key cryptosystem after the advent of ... [more] | VLD2021-81 HWS2021-58 pp.31-36 |
| NLP, MICT, MBE, NC (Joint) [detail] |
2022-01-23 10:15 |
Online | Online | A simple method for estimating phase and amplitude functions of limit-cycle oscillators by polynomial regression from time series data Norihisa Namura, Hiroya Nakao (Tokyo Tech.) NLP2021-122 MICT2021-97 MBE2021-83 |
In the real world, there are various nonlinear rhythmic phenomena, many of which can be modeled mathematically as limit-... [more] | NLP2021-122 MICT2021-97 MBE2021-83 pp.237-242 |
| COMP | 2021-12-03 | Ishikawa | Kanazawa Chamber of Commerce and Industry (Primary: On-site, Secondary: Online) |
Polynomial-time Extraction of the Maximum Clique Using Eigenvalue Relation Yasunori Ohto |
We prove that the maximum clique problem can be solved in polynomial time. First, we prove the relationship between the ... [more] | |
| CAS, NLP | 2021-10-14 13:25 |
Online | Online | A simple method for estimating phase functions of limit cycles by polynomial regression from time series data Norihisa Namura, Hiroya Nakao (Tokyo Tech.) CAS2021-23 NLP2021-21 |
Many rhythmic phenomena in the real world are mathematically modeled as limit-cycle oscillators. The phase reduction a... [more] |
CAS2021-23 NLP2021-21 pp.35-38 |
| COMP | 2020-12-04 12:50 |
Online | Online | [Invited Talk]
A Blossom Algorithm for Maximum Edge-Disjoint T-Paths Satoru Iwata (Univ. of Tokyo), Yu Yokoi (NII) COMP2020-22 |
Let $G=(V,E)$ be a multigraph with a set $Tsubseteq V$ of terminals. A path in $G$ is called a $T$-path if its ends are ... [more] | COMP2020-22 p.28 |
| COMP | 2020-03-01 14:50 |
Tokyo | The University of Electro-Communications (Cancelled but technical report was issued) |
Minmax regret 1-sink problem with parametric weights Yuki Tokuni (Kwansei Gakuin Univ.), Noaki Katoh, Junichi Teruyama, Yuya Higashikawa, Tetsuya Fujie (Univ. of Hyogo) COMP2019-51 |
This paper addresses the minmax regret 1-sink problem in dynamic path networks with parametric weights. A dynamic path n... [more] | COMP2019-51 pp.35-41 |
| EST | 2020-01-30 11:35 |
Oita | Beppu International Convention Center | Variability Analysis of a Non-Uniform Transmission Line Using Polynomial Chaos Method Tadatoshi Sekine, Shin Usuki, Kenjiro T. Miura (Shizuoka Univ.) EST2019-84 |
In this report, we propose a technique which estimates statistical information of electrical properties of transmission ... [more] | EST2019-84 pp.31-36 |
| COMP | 2019-09-02 14:15 |
Okayama | Tsushima Campus, Okayama University | Space efficient separator algorithms for planar graphs Osamu Watanabe (Tokyo Inst. of Tech.) COMP2019-13 |
The Separator Theorem states that any planar graph G with n vertices has a separator of size O(n^{1/2}), that is, a set ... [more] | COMP2019-13 pp.17-24 |
| NLP, MSS (Joint) |
2019-03-15 14:05 |
Fukui | Bunkyo Camp., Univ. of Fukui | Estimation of the critical transition probability using quadratic polynomial approximation Makito Oku (Univ. Toyama) NLP2018-135 |
Critical transitions are large-scale state transitions that occur occasionally in various complex systems such as ecosys... [more] | NLP2018-135 pp.57-62 |
| COMP | 2018-12-12 10:50 |
Miyagi | Tohoku University | Minimization of an M-convex Function under L1-distance Constraint Akiyoshi Shioura (Tokyo Inst. Tech.) COMP2018-33 |
In this paper we consider a new problem of minimizing an M-convex function under L1-distance constraint (MML1); the cons... [more] | COMP2018-33 pp.15-20 |
| COMP | 2018-09-18 13:25 |
Fukuoka | Kyusyu Institute of Technology | Minimax regret 1-center problems with parametric weights Shohei Ookatsu, Naoki Katoh (Kwansei Gakuin Univ.), Junichi Teruyama, Yuya Higashikawa (Univ. of Hyogo), Hiroyoshi Miwa (Kwansei Gakuin Univ.) COMP2018-13 |
In this paper, based on the minimax regret model which is an approach for the robust optimization, we consider 1-center ... [more] | COMP2018-13 pp.29-33 |
[Return to Top Page]