Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
SeMI |
2024-01-19 11:25 |
Yamanashi |
Raki House Kaiji |
Trajectory Optimization of Multiple Aerial Base Stations for Traffic Changes Maki Kozaki, Takeshi Hirai, Rei Oda, Naoki Wakamiya (Osaka Univ.) SeMI2023-68 |
This paper optimizes, we have identified trajectories of multiple aerial base stations (ABSs) to maximize the throughput... [more] |
SeMI2023-68 pp.100-105 |
COMP |
2023-12-22 13:20 |
Miyazaki |
Miyazaki Univ. Machinaka Campus |
A fixed-parameter algorithm for dissimilar shortest paths Ryo Funayama, Yasuaki Kobayashi (Hokkaido Univ.) COMP2023-20 |
(To be available after the conference date) [more] |
COMP2023-20 pp.21-28 |
RISING (3rd) |
2023-10-31 10:45 |
Hokkaido |
Kaderu 2・7 (Sapporo) |
[Poster Presentation]
Formulation of a Social Surplus Optimization Problem for Predicting Fishing Outcomes Using Federated Learning Shotaro Kitano, Shota Miyagoshi, Takuji Tachibana (Univ. Fukui) |
In cross-device federative learning, where each client participates with an IoT device such as a smartphone, a large num... [more] |
|
MIKA (3rd) |
2023-10-10 15:35 |
Okinawa |
Okinawa Jichikaikan (Primary: On-site, Secondary: Online) |
[Poster Presentation]
A Consideration of Data Smoothing and Weight Orthogonalization in Blind Signal Separation Using Kurtosis Maximization Algorithm Shogo Osakabe, Nobuyoshi Kikuma, Kunio Sakakibara, Yoshiki Sugimoto (NITech) |
With the recent rapid evolution in wireless communications, the demand for high-quality, low-latency transmission and th... [more] |
|
MSS, CAS, SIP, VLD |
2023-07-07 15:20 |
Hokkaido |
(Primary: On-site, Secondary: Online) |
Verification of effectiveness of the greedy algorithm for the influence maximization problem focusing on the authenticity in OSN Jodai Yoshiue, Atsushi Wakamatsu, Masaaki Miyasita, Norihiko Shinomiya (Soka Univ.) CAS2023-28 VLD2023-28 SIP2023-44 MSS2023-28 |
In recent years, social media has become increasingly popular. While it has advantages such as high advertising effectiv... [more] |
CAS2023-28 VLD2023-28 SIP2023-44 MSS2023-28 pp.143-146 |
NLP, MSS |
2023-03-17 10:20 |
Nagasaki |
(Primary: On-site, Secondary: Online) |
A method of suppressing false information diffusion in OSN Atsushi Wakamatsu, Masaaki Miyashita, Norihiko Shinomiya (Soka Univ.) MSS2022-95 NLP2022-140 |
The diffusion of false information in online social networks is a serious problem.Despite various countermeasures, it is... [more] |
MSS2022-95 NLP2022-140 pp.156-159 |
CQ, CBE (Joint) |
2023-01-27 10:40 |
Ibaraki |
Epochal Tsukuba International Congress Center (Primary: On-site, Secondary: Online) |
Verification of effectiveness of the greedy algorithm for the influence maximization problem focusing on the authenticity in OSN Jodai Yoshiue, Atsushi Wakamatsu, Msaaki Miyashita, Norihiko Shinomiya (Soka Univ.) CQ2022-73 |
In recent years, social media has become increasingly popular. While it has advantages such as high advertising effectiv... [more] |
CQ2022-73 pp.69-72 |
CQ, MIKA (Joint) |
2021-09-09 11:35 |
Online |
Online |
On the Effectiveness of Breadth-First Search for Influence Maximization on Unknown Networks Yuki Wakisaka, Ryotaro Matsuo (Kwansei Gakuin Univ.), Sho Tsugawa (Tsukuba Univ.), Hiroyuki Ohsaki (Kwansei Gakuin Univ.) CQ2021-42 |
Recently, the influence maximization problem for unknown networks has received much attention. The problem aims to ident... [more] |
CQ2021-42 pp.29-34 |
NLP, MSS (Joint) |
2021-03-15 13:25 |
Online |
Online |
Graph Structure Optimization Using Genetic Algorithms Hiroki Tajiri, Tsuyoshi Migita, Norikazu Takahashi (Okayama Univ.) NLP2020-59 |
There are many large and complex networks in the real world. These networks are modeled as graphs and analyzed using a v... [more] |
NLP2020-59 pp.23-28 |
NLP, MSS (Joint) |
2021-03-16 13:00 |
Online |
Online |
On Maximizing Utility of Information Diffusion in Social Networks Masaaki Miyashita, Daisuke Kasamatsu, Norihiko Shinomiya (Soka Univ.) MSS2020-52 |
A purpose of information diffusion performed by information providers is to maximize the total utility of users, such as... [more] |
MSS2020-52 pp.43-46 |
IN, NS (Joint) |
2021-03-04 09:10 |
Online |
Online |
A Proposal for Two Types of Flows Admission Control Using Stochastic Evolutionary Game Theory Kojima Taichi, Sumiko Miyata (SIT) IN2020-58 |
A call admission control scheme has been proposed to maximize the satisfaction of all users when accommodating communica... [more] |
IN2020-58 pp.25-30 |
IE, ITS, ITE-MMS, ITE-ME, ITE-AIT [detail] |
2021-02-18 11:35 |
Online |
Online |
A Note on Accurate Distress Image Classification of Road Structures Using Attention Map based on Text Data Naoki Ogawa, Keisuke Maeda, Takahiro Ogawa, Miki Haseyama (Hokkaido Univ.) |
This paper presents a correlation-aware attention branch network (CorABN) using multi-modal data for deterioration level... [more] |
|
NS, IN (Joint) |
2020-03-06 15:10 |
Okinawa |
Royal Hotel Okinawa Zanpa-Misaki (Cancelled but technical report was issued) |
A proposal of accesses control for two types web contents considering tolerable delay time Kosuke Watanabe, Sumiko Miyata (SIT) IN2019-146 |
When a user browses a Web site, the user has time to wait until the Web site is displayed (hereinafter,
tolerable delay... [more] |
IN2019-146 pp.405-410 |
MIKA (2nd) |
2019-10-03 11:15 |
Hokkaido |
Hokkaido Univ. |
[Poster Presentation]
Study on the Effectiveness of Random Node Sampling in Influence Maximization on Graph Yuki Wakisaka, Kazuyuki Yamashita (Kwansei Gakuin Univ.), Sho Tsugawa (Univ. of Tsukuba), Hiroyuki Ohsaki (Kwansei Gakuin Univ.) |
Influence maximization in a social network has been intensively studied,
motivated by its application to so-called vi... [more] |
|
MIKA (2nd) |
2019-10-03 11:15 |
Hokkaido |
Hokkaido Univ. |
[Poster Presentation]
An Evaluation of Data-Based Influence Maximization Algorithm using Retweet Logs Takuya Nagase, Sho Tsugawa (Univ.Tsukuba) |
Influence maximization on social networks has been extensively studied in the literature. Influence maximization algorit... [more] |
|
IBISML |
2019-03-05 14:30 |
Tokyo |
RIKEN AIP |
Efficient Exploration by Variational Information Maximizing Exploration on Reinforcement Learning Kazuki Doi, Keigo Okawa (Gifu Univ.), Motoki Shiga (Gifu Univ./JST/RIKEN) IBISML2018-107 |
In reinforcement learning,the policy function may not be optimized properly if the observed state space is limited to lo... [more] |
IBISML2018-107 pp.17-22 |
IBISML |
2018-11-05 15:10 |
Hokkaido |
Hokkaido Citizens Activites Center (Kaderu 2.7) |
[Poster Presentation]
An Efficient Branch-and-Bound Algorithm for Submodular Function Maximization Naoya Uematsu, Shunji Umetani, Yoshinobu Kawahara (Osaka Univ./RIKEN) IBISML2018-68 |
The submodular function maximization is an attractive optimization model that appears in many real applications.
Altho... [more] |
IBISML2018-68 pp.183-190 |
IBISML |
2018-11-05 15:10 |
Hokkaido |
Hokkaido Citizens Activites Center (Kaderu 2.7) |
[Poster Presentation]
Regularized Modal Regression via Iteratively Reweighted Least-Squares Ryoya Yamasaki, Toshiyuki Tanaka (Kyoto Univ.) IBISML2018-88 |
In modal regression, iterative methods that are based on the modal EM (MEM) and those based on the iteratively reweighte... [more] |
IBISML2018-88 pp.329-335 |
NLP, CCS |
2018-06-10 10:45 |
Kyoto |
Kyoto Terrsa |
Use of recurrent infomax to improve the information processing capability of input-driven recurrent neural networks Hisashi Iwade (Kyoto Univ.), Kohei Nakajima (Univ. Tokyo/JST PRESTO), Takuma Tanaka (Shiga Univ.), Toshio Aoyagi (Kyoto Univ.) NLP2018-42 CCS2018-15 |
Reservoir computing (RC) is known to be a novel information processing framework, which exploits the inherent transient ... [more] |
NLP2018-42 CCS2018-15 pp.79-84 |
RCS |
2018-04-23 11:20 |
Yamaguchi |
Hotel New Tanaka, Yuda Onsen |
Optimization of Beam Patterns for Analog Beamforming of Single User Massive MIMO Transmissions Maki Arai, Kei Sakaguchi, Kiyomichi Araki (Tokyo Inst. of Tech.) RCS2018-5 |
This paper proposes optimal beam patterns of analog beamforming for SU (Single User) massive MIMO (Multi-Input Multi-Out... [more] |
RCS2018-5 pp.25-30 |