Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
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 |
COMP |
2010-01-25 17:00 |
Fukuoka |
Nishijin Plaza, Kyushu University |
[Fellow Memorial Lecture]
Invited Talk as a New Fellow Masafumi Yamashita (Kyushu Univ) COMP2009-48 |
[more] |
COMP2009-48 p.65 |
COMP |
2009-05-26 10:05 |
Saitama |
Saitama Univ. |
A Tight Upper Bound on the Hitting and the Cover times of Metropolis Walks Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ) COMP2009-10 |
andom walks on finite graphs are random token circulation on graphs. Random walks such that token moves to adjacent vert... [more] |
COMP2009-10 pp.9-12 |
COMP |
2008-05-13 14:30 |
Fukuoka |
Kyushu Sangyo University |
On Necessary Conditions of Linear Cover Time Random Walks Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyusyu Univ) COMP2008-12 |
A random walk on a finite graph is a model that a token on a vertex repeatedly moves to an adjacent vertex randomly chos... [more] |
COMP2008-12 pp.33-36 |
COMP |
2007-09-20 13:15 |
Aichi |
|
Approximating the Distribution Function of Minimum Spanning Tree Cost with Normally Disributed Stochastic Edge Weights Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) COMP2007-35 |
Given a graph $G$ of $n$ vertices whose edge weights are
random variables and obey mutually
independent normal distri... [more] |
COMP2007-35 pp.21-27 |
COMP |
2007-05-25 15:55 |
Fukuoka |
Kyushu University |
Optimality and Algorithms for the Balanced Edge Cover Problem Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) COMP2007-17 |
For an undirected graph $G = (V, E)$, an edge cover is defined as a set of edges that covers all vertices of $V$. It is... [more] |
COMP2007-17 pp.37-42 |
COMP |
2007-03-05 09:00 |
Tokyo |
The University of Electro-Communications |
Failure Detectors for Solving k-Set Agreement Atsushi Sakata, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
[more] |
COMP2006-50 pp.1-6 |
COMP |
2006-05-24 15:00 |
Fukuoka |
Kyushu Institute of Technology |
DNA Sequence Design Using Hidden Markov Models Kazuya Maemura, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
DNA computing is a new computation paradigm to take reaction process of DNA as computation.The design of DNA sequence is... [more] |
COMP2006-15 pp.39-46 |
COMP |
2006-05-24 15:35 |
Fukuoka |
Kyushu Institute of Technology |
DNA Sequence Design by Dynamic Neighborhood Searches Suguru Kawashimo, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
In recent years, DNA sequence sets are used in various fields such as nanotechnology and nanocomputing. Since there are ... [more] |
COMP2006-16 pp.47-54 |
COMP |
2006-04-26 09:20 |
Kyoto |
Kyoto University |
Optimality of Balanced Semi-Matchings Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
We consider the problem of finding a semi-matching for a bipartite graph $G = (U \cup V,E)$. A semi-matching is defined ... [more] |
COMP2006-1 pp.1-8 |
COMP |
2006-04-26 13:40 |
Kyoto |
Kyoto University |
Searching Scale-Free Networks with Local Information Yuichi Kurumida, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
We consider the problem of exploring networks as few steps as possible using small amount of memory. There exist many wo... [more] |
COMP2006-5 pp.33-39 |
COMP |
2005-12-22 15:50 |
Tokushima |
The University of Tokushima |
Failure Detectors for the Leader Election with Bounded Faulty Processes Hirotaka Ono (Kyushu Univ.), Sung-Hoon Park (Chungbuk Univ.), Masafumi Yamashita (Kyushu Univ.) |
[more] |
COMP2005-55 pp.43-47 |
COMP |
2005-05-20 10:15 |
Fukuoka |
Kyushu Univ. |
Effient Indexing and Updating of Text Databases Takamoto Goto, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
[more] |
COMP2005-9 pp.1-8 |
COMP |
2004-12-10 15:30 |
Chiba |
Toho University |
A Quantum Algorithm for Counting Approximate Pattern Occurrences Takenori Kobayashi, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
[more] |
COMP2004-58 pp.31-36 |
COMP |
2004-10-15 15:25 |
Miyagi |
Tohoku University |
A Local Search Algorithm for Barrier Heights Estimation in DNA computing Tsutomu Takeda, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
DNA computing is a new computing paradigm utilizing the transitions of DNA
molecules as computation. In the context, th... [more] |
COMP2004-49 pp.41-46 |