| 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 | 2024-03-14 14:45 |
Tokyo | The University of Electro-Communications (Tokyo) | Reforming an Envy-Free Matching with Ties Yuni Iwamasa, Jun Kawahara, Yuito Ueda (Kyoto Univ.)  COMP2023-32 |
An envy-free matching is a type of matching between agents and items such that each agent have a preference order for th... [more] | COMP2023-32 pp.23-30 |
| COMP, IPSJ-AL | 2023-05-10 14:30 |
Hokkaido | Hokkaido University (Hokkaido) | [Invited Talk]
Reallocation Problems with Minimum Completion Time Toshimasa Ishii (Hokkaido Univ.), Jun Kawahara, Kazuhisa Makino (Kyoto Univ.), Hirotaka Ono (Nagoya Univ.) COMP2023-1 |
Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logist... [more] | COMP2023-1 p.1 |
| COMP | 2020-12-04 10:00 |
Online | Online (Online) | A Fast ZDD-Based Method for Enumerating All Solutions of Cost-Bounded Combinatorial Problems Shin-ichi Minato (Kyoto Univ.), Mutsunori Banbara (Nagoya Univ.), Takashi Horiyama (Hokkaido Univ.), Jun Kawahara (Kyoto Univ.), Ichigaku Takigawa (Hokkaido Univ.), Yutaro Yamaguchi (Kyushu Univ.) COMP2020-19 |
[more] | COMP2020-19 pp.8-15 |
| COMP | 2020-03-01 16:00 |
Tokyo | The University of Electro-Communications (Tokyo) (Cancelled but technical report was issued) |
Information theoretic lower bound of Hasse diagrams with degree constraint Jumpei Mori, Jun Kawahara, Shinichi Minato (Kyoto Univ.) COMP2019-53 |
[more] | COMP2019-53 pp.51-56 |
| NS | 2019-10-10 16:10 |
Aichi | Nagoya Institute of Technology (Aichi) | [Invited Talk]
On recent developments in network reliability computation using binary decision diagrams Jun Kawahara (Kyoto Univ.) NS2019-113 |
Given a network with static link failure probabilities, the network reliability is to compute the probability that two s... [more] | NS2019-113 pp.59-62 |
| COMP | 2019-09-02 10:50 |
Okayama | Tsushima Campus, Okayama University (Okayama) | Shortest Universal Sequences of Adjacent Transpositions Takehiro Ito (Tohoku Univ.), Jun Kawahara, Shin-ichi Minato (Kyoto Univ.), Yota Otachi (Kumamoto Univ.), Toshiki Saitoh (Kyutech), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII), Katsuhisa Yamanaka (Iwate Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-10 |
Let $S = {s_1,s_2, ... , s_m}$ be a sequence of adjacent transpositions of $[n]={1,2,ldots ,n}$. We denote by $Comp(S) =... [more] | COMP2019-10 pp.1-5 |
| COMP | 2019-09-02 16:00 |
Okayama | Tsushima Campus, Okayama University (Okayama) | 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, IPSJ-AL | 2019-05-11 10:40 |
Kumamoto | Kumamoto University (Kumamoto) | Enumerating and Indexing Graph Subdivisions using Zero-suppressed Binary Decision Diagrams Yu Nakahata, Jun Kawahara (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Shin-ichi Minato (Kyoto Univ.) COMP2019-3 |
A subdivision of a graph $H$ is a graph obtained by inserting some vertices into each edge of $H$. In this paper, when ... [more] |
COMP2019-3 pp.51-58 |
| IMQ, IE, MVE, CQ (Joint) [detail] |
2019-03-15 13:50 |
Kagoshima | Kagoshima University (Kagoshima) | Network reliability evaluation with arbitrary dependencies on link failures Jun Kawahara (NAIST), Takeru Inoue (NTT), Shoji Kasahara (NAIST) CQ2018-113 |
Given a network and the failure ratio of each link of the network, network reliability evaluation is to compute the prob... [more] | CQ2018-113 pp.111-116 |
| ICM | 2019-03-08 09:20 |
Okinawa | (Okinawa) | Pricing and Resource Allocation on Hadoop Data Centers Using Auction Mechanisms Yu Manabe, Jun Kawahara, Shoji Kasahara (NAIST) ICM2018-57 |
As storage capacity and computing performance grow due to the development of hardware, it is possible for applications t... [more] | ICM2018-57 pp.43-48 |
| COMP | 2018-10-26 15:55 |
Kyoto | Kyoto University (Kyoto) | [Invited Lecture]
Report of Presentation in SEA2018 and Recent Study Yu Nakahata, Jun Kawahara (NAIST) COMP2018-29 |
Partitioning a graph into balanced components is important for several applications. For multi-objective problems, it is... [more] | COMP2018-29 p.57 |
| ICM | 2018-03-09 09:00 |
Okinawa | (Okinawa) | Analysis of tasks that continuously generate error events in cloud platforms Koji Mandai, Jun Kawahara, Shoji Kasahara (NAIST) ICM2017-64 |
In this research, we analyze the characteristics of failed jobs in data sets recording the execution status of jobs and ... [more] | ICM2017-64 pp.49-54 |
| CS, NS, IN, NV (Joint) |
2017-09-08 10:50 |
Miyagi | Research Institute of Electrical Communication, Tohoku Univ. (Miyagi) | Performance Inference for Cooperative Spectrum Sensing with the k-out-of-N Rule: An MCMC-based Approach Sho Iizuka, Jun Kawahara, Shoji Kasahara (NAIST) NS2017-82 |
In the research of cognitive radio, Cooperative Spectrum Sensing (CSS) is proposed, in which the secondary users (SUs) f... [more] | NS2017-82 pp.67-72 |
| NS, IN (Joint) |
2017-03-03 14:50 |
Okinawa | OKINAWA ZANPAMISAKI ROYAL HOTEL (Okinawa) | Coalition formation approach for cooperative spectrum sensing in cognitive radio networks by multi-armed bandit problem Sho Iizuka, Jun Kawahara, Shoji Kasahara (NAIST) NS2016-242 |
In cognitive radio networks, it is important for secondary users (SUs) to accurately sense wireless channels for primary... [more] | NS2016-242 pp.487-492 |
| COMP, IPSJ-AL | 2016-06-24 15:45 |
Ishikawa | (Ishikawa) | Enumerating Letter Graphs by Zero-suppressed Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kobe Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2016-8 |
A zero-suppressed binary decision diagram (ZDD) is a compact data structure that represents a family of sets. A framewor... [more] | COMP2016-8 pp.33-40 |
| IE, IMQ, MVE, CQ (Joint) [detail] |
2016-03-07 09:00 |
Okinawa | (Okinawa) | Design, implementation, and evaluation of an offline evacuation guiding application considering positioning errors of mobile nodes Junki Itoi, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara (NAIST) CQ2015-108 |
It is highly desired to achieve speedy evacuation guiding even when part/all of communication infrastructure suffers fro... [more] | CQ2015-108 pp.1-6 |
| IE, IMQ, MVE, CQ (Joint) [detail] |
2016-03-07 09:15 |
Okinawa | (Okinawa) | On Information Sharing Scheme for Automatic Evacuation Guiding System Based on Cooperation between Evacuees and Their Mobile Nodes Nobuhisa Komatsu, Masahiro Sasabe, Jun Kawahara, Shoji Kasahara (NAIST) CQ2015-109 |
We have proposed an automatic evacuation guiding scheme based on cooperation between evacuees and their mobile nodes. I... [more] |
CQ2015-109 pp.7-12 |
| IE, IMQ, MVE, CQ (Joint) [detail] |
2016-03-07 09:30 |
Okinawa | (Okinawa) | Evaluation of influence of a mobility model based on person trip data on DTN routing Akio Ishikura, Jun Kawahara, Masahiro Sasabe, Shoji Kasahara (NAIST) CQ2015-110 |
In delay tolerant networking (DTN), data communication is realized even if interruption or disruption occurs. When we ev... [more] | CQ2015-110 pp.13-18 |
| NS, IN (Joint) |
2016-03-04 09:30 |
Miyazaki | Phoenix Seagaia Resort (Miyazaki) | Evaluating connectivity on physical networks with switch failures Koki Sonoda, Jun Kawahara (NAIST), Takeru Inoue (NTT), Shoji Kasahara (NAIST), Osamu Akashi, Ryoichi Kawahara, Hiroshi Saito (NTT) NS2015-213 |
In a network reliability evaluation, it is a problem to compute the probability that two specified nodes can communicate... [more] | NS2015-213 pp.261-266 |
| CQ | 2015-07-06 13:00 |
Nara | Nara Institute of Science and Technology (Nara) | [Poster Presentation]
Path Enumeration Algorithm Using Zero-Suppressed Binary Decision Diagram for Path Selection in Overlay Networks Koki Sonoda, Jun Kawahara, Masahiro Sasabe, Shoji Kasahara (NAIST) CQ2015-29 |
For end-to-end communication in overlay networks, we need to quickly select an appropriate path from the viewpoints of t... [more] | CQ2015-29 pp.51-54 |
[Return to Top Page]