| 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 # | |
| NLP, MSS | 2024-03-14 11:15 |
Misc. | Kikai-Shinko-Kaikan Bldg. | Parallelization of a Search Algorithm for Regular Graphs with Minimum Average Shortest Path Length Taku Hirayama, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.)  MSS2023-89 NLP2023-141 |
Computer networks in data centers are modeled as regular graphs, and the average shortest path length (ASPL) of such a g... [more] | MSS2023-89 NLP2023-141 pp.87-92 |
| NLP, CAS | 2023-10-07 13:00 |
Gifu | Work plaza Gifu | An algorithm for finding regular graphs that maximize algebraic connectivity under a specified number of vertices and degree Masashi Kurahashi, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) CAS2023-54 NLP2023-53 |
Algebraic connectivity is a measure of network robustness, and defined by the second smallest eigenvalue of the Laplacia... [more] | CAS2023-54 NLP2023-53 pp.106-110 |
| COMP | 2021-03-08 15:45 |
Online | Online | A further improved MCT algorithm for finding a maximum clique Jiro Yanagisawa, Etsuji Tomita (UEC), Kengo Katayama, Kanahara Kazuho (OUS), Takahisa Toda, Hiro Ito, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2020-35 |
We improve further the MCT algorithm for finding a maximum clique （FAW 2016, LNCS 9711, pp.215-226, 2016). First, we em... [more] | COMP2020-35 pp.38-45 |
| PRMU, BioX | 2016-03-25 14:00 |
Tokyo | Worker Detection in Office Environment with Multi-weak Detectors for Human Shapes Yuichiro Fujimoto, Masano Nakayama, Hitomi Yokoyama, Ikuko Shimizu, Kinya Fujita (TUAT) BioX2015-63 PRMU2015-186 |
It is expected that auto classification of workers' behavior and communication analysis among workers leads to improveme... [more] | BioX2015-63 PRMU2015-186 pp.131-136 |
|
| IA | 2014-11-06 16:50 |
Overseas | Thailand | Graphical User Interface Tool for JAVA Code Generator Using Depth First Search Technique on Directed Graph Piyavach Khunsongkiet, Eakkarat Boonchieng (Chiang Mai Univ.) IA2014-57 |
The Graphical user interface tool for Java code generator using depth first search (DFS) technique on directed graph is ... [more] | IA2014-57 pp.121-126 |
| COMP, IPSJ-AL | 2014-06-14 10:55 |
Ehime | Matsuyama, Ehime | A Further Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi (Waseda Univ.), Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2014-13 |
This paper presents a further improved extended result for polynomial-time solvability of the maximum clique problem, th... [more] | COMP2014-13 pp.85-92 |
| COMP | 2012-09-03 10:50 |
Tokyo | Hosei University | An Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2012-28 |
This paper presents an improved extended result for polynomial-time solvability of the maximum clique problem, that is: ... [more] |
COMP2012-28 pp.17-24 |
| COMP | 2011-10-21 11:10 |
Miyagi | Tohoku Univ. | An Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2011-30 |
This report presents a result for polynomial-time solvability of the maximum clique problem, that is:for any pair of ver... [more] | COMP2011-30 pp.15-22 |
| COMP | 2011-04-22 13:55 |
Kyoto | Kyoto University | A further improved result on polynomial-time solvability of the maximum clique problem Hiroaki Nakanishi (UEC), Etsuji Tomita (UEC/Chuo Univ.), Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2011-6 |
This report presents a further improved result for polynomial-time solvability of the maximum clique problem, that is: f... [more] | COMP2011-6 pp.41-48 |
| COMP | 2010-12-03 14:30 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology | An improved result on polynomial-time solvability of the maximum clique problem Hiroaki Nakanishi, Etsuji Tomita (UEC) COMP2010-43 |
This report presents an improved result for polynomial-time solvability of the maximum clique problem which is a typical... [more] | COMP2010-43 pp.29-36 |
| MBE, NC (Joint) |
2010-11-18 11:15 |
Miyagi | Tohoku University | Influence of disparity-based depth propagation on surface perception Shinpei Kasai (GSIS), Kazumichi Matsumiya, Rumi Tokunaga, Ichiro Kuriki, Satoshi Shioiri (GSIS/RIEC) MBE2010-40 |
We see the edge and surface of objects in the 3D visual world. Research has revealed the mechanisms of the edge detectio... [more] | MBE2010-40 pp.25-29 |
| NS, ICM, CQ (Joint) |
2007-11-16 08:50 |
Fukuoka | Institute of System LSI Design Industry, Fukuoka | A Fiber Allocation Search Algorithm for a Demand Expansion Term of Optical Network Services Masaya Shibaki, Shunsuke Kanai, Tatsuru Kawano, Tsutomu Maruyama (NTT) TM2007-36 |
We develop an Operation Support System (OSS) for provide optical access networks (OANs) Service quickly. This Ops condit... [more] | TM2007-36 pp.13-18 |
| R | 2007-06-22 13:25 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A study on Efficient Algorithm for Solving Optimal Component Arrangement Problem of Circular Consecutive-k-out-of-n: F System Koji Shingyochi (Jumonji Univ.), Hisashi Yamamoto (Tokyo Metropolitan Univ.) R2007-15 |
A Circular Consecutive-k-out-of-n: F system consists of n components arranged along a circular path. This system fails i... [more] | R2007-15 pp.7-12 |
[Return to Top Page]