Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP, IPSJ-AL |
2024-05-08 15:05 |
Kyoto |
Kyoto University (Rakuyu-kaikan) |
An Algorithm for Finding the Condorcet Winner Die Ro Sho, Hatano Kohei (Kyushu Univ.), Kijima Shuji (Shiga Univ.), Takimoto Eiji (Kyushu Univ.) |
[more] |
|
COMP |
2024-03-14 15:15 |
Tokyo |
The University of Electro-Communications |
A proof of recurrence of a random walk on a growing network by a coupling technique Shuma Kumamoto (Kyushu U), Shuji Kijima (Shiga U), Tomoyuki Shirai (Kyushu U) COMP2023-33 |
[more] |
COMP2023-33 pp.31-33 |
COMP |
2023-10-24 16:55 |
Aichi |
Nagoya Univ. Venture Business Lab. |
On Space Complexity of Generating a Tent Code Naoaki Okada (Kyushu Univ.), Shuji Kijima (Shiga Univ.) COMP2023-15 |
This paper is motivated by a question whether it is possible to calculate a chaotic sequence efficiently, e.g., is it po... [more] |
COMP2023-15 pp.21-23 |
COMP |
2022-12-06 11:00 |
Ehime |
Ehime Univ. Media Hall |
Average space complexity of tent expansions around the golden ratio Naoaki Okada (Kyushu Univ.), Shuji Kijima (Shiga Univ.) COMP2022-24 |
(To be available after the conference date) [more] |
COMP2022-24 pp.18-20 |
COMP |
2022-03-06 14:45 |
Online |
Online |
[Invited Talk]
Is There a Strongest Die in a Set of Dice with the Same Mean Pips? Shang Lu, Shuji Kijima (Kyushu Univ.) COMP2021-35 |
[more] |
COMP2021-35 p.25 |
ICSS, IPSJ-SPT |
2021-03-01 13:40 |
Online |
Online |
An Evaluation of Scalable Clustering in Fast Construction Algorithm of Phylogenetic Tree Tianxiang He (Kyushu Univ.), Chansu Han, Ryoichi Isawa, Takeshi Takahashi (NICT), Shuji Kijima, Jun'ichi Takeuchi (Kyushu Univ.) ICSS2020-38 |
[more] |
ICSS2020-38 pp.72-77 |
COMP |
2020-12-04 14:00 |
Online |
Online |
[Invited Talk]
How many vertices does a random walk miss in a network with moderately increasing the number of vertices? Shuji Kijima (Kyushu Univ.), Nobutaka Shimizu (The Univ. of Tokyo), Takeharu Shiraga (Chuo Univ.) COMP2020-23 |
Real networks are often dynamic. In response to it, analyses of algorithms on dynamic networks attract more and more att... [more] |
COMP2020-23 p.29 |
COMP |
2020-03-01 16:50 |
Tokyo |
The University of Electro-Communications (Cancelled but technical report was issued) |
Online Learning for A Repeated Markovian Game with 2 States Shangtong Wang, Shuji Kijima (Kyushu Univ.) COMP2019-55 |
We consider a new problem of learning in repeated games. In our model, the players play on one of the several game matri... [more] |
COMP2019-55 pp.65-68 |
ICSS |
2019-11-13 13:55 |
Miyazaki |
MRT Terrace(Miyazaki) |
A Fast Algorithm for Constructing Phylogenetic Trees and Its Evaluation Tianxiang He (Kyushu Univ.), Chansu Han, Ryoichi Isawa, Takeshi Takahashi (NICT), Shuji Kijima, Jun'ichi Takeuchi (Kyushu Univ.), Koji Nakao (NICT) ICSS2019-61 |
[more] |
ICSS2019-61 pp.7-12 |
COMP, IPSJ-AL |
2019-05-11 13:30 |
Kumamoto |
Kumamoto University |
[Invited Talk]
Plane Formation by Synchronous Mobile Robots in the Three-Dimensional Euclidean Space Yukiko Yamauchi, Taichi Uehara, Shuji Kijima, Masafumi Yamashita (Kyushu Univ.) COMP2019-6 |
[more] |
COMP2019-6 p.75 |
COMP |
2017-03-07 14:50 |
Aichi |
Nanzan University |
An Optimal Online Graph Search Algorithm in terms of the Number of Searchers Takahiro Yakami, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita (Kyushu Univ.) COMP2016-54 |
The graph search problem is the problem of searching for a mobile evader in a graph by mobile searchers.The edge search ... [more] |
COMP2016-54 pp.21-28 |
IBISML |
2015-11-26 15:00 |
Ibaraki |
Epochal Tsukuba |
[Poster Presentation]
Regret Analysis for Online Binary Search Trees with Switching Costs Tadahiro Matsukawa, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita (Kyushu Univ.) |
[more] |
|
COMP |
2013-03-18 10:20 |
Gifu |
Gifu University |
Reservoir sampling in stream using O(log log n) space Naoto Sonoda, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita (Kyushu Univ.) COMP2012-53 |
This paper presents a simple algorithm for uniform sampling of elements in a stream; that is for reservoir sampling uses... [more] |
COMP2012-53 pp.5-12 |
IBISML |
2012-06-19 11:00 |
Kyoto |
Campus plaza Kyoto |
Online Prediction under Submodular Constraints Daiki Suehiro, Kohei Hatano, Shuji Kijima, Eiji Takimoto (Kyushu Univ.), Kiyohito Nagano (Tokyo Univ.) IBISML2012-3 |
[more] |
IBISML2012-3 pp.15-22 |
COMP |
2010-04-22 10:35 |
Shiga |
Ritusmeikan University, Biwako-Kusatsu Campus |
Counting the number of dominating sets in graph classes Shuji Kijima (Kyushu Univ), Yoshio Okamoto (Tokyo Inst. of Tech.), Takeaki Uno (NII) COMP2010-2 |
[more] |
COMP2010-2 pp.9-15 |
COMP |
2009-06-29 14:50 |
Hokkaido |
Hokkaido University |
A Polynomial-time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise Masaki Yamamoto (Tokai Univ.), Shuji Kijima (Kyoto Univ.), Yasuko Matsui (Tokai Univ.) COMP2009-23 |
[more] |
COMP2009-23 pp.37-44 |
COMP |
2004-10-14 16:15 |
Miyagi |
Tohoku University |
Shuji Kijima, Tomomi Matsui (Univ. Tokyo) |
In this paper, we propose a perfect (exact) sampler for closed Jackson Networks. Our algorithm is a sampling with Markov... [more] |
COMP2004-42 pp.55-59 |