#### Filter Results:

- Full text PDF available (31)

#### Publication Year

1978

2017

- This year (4)
- Last 5 years (33)
- Last 10 years (47)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Toru Sasaki, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
- OPODIS
- 2013

- Shota Yasutake, Kohei Hatano, Shuji Kijima, Eiji Takimoto, Masayuki Takeda
- ISAAC
- 2011

This paper proposes an algorithm for online linear optimization problem over permutations; the objective of the online algorithm is to find a permutation of {1, . . . , n} at each trial so as to minimize the “regret” for T trials. The regret of our algorithm is O(n √ T lnn) in expectation for any input sequence. A naive implementation requires more than… (More)

We consider an online prediction problem of combinatorial concepts where each combinatorial concept is represented as a vertex of a polyhedron described by a submodular function (base polyhedron). In general, there are exponentially many vertices in the base polyhedron. We propose polynomial time algorithms with regret bounds. In particular, for… (More)

- Nao Fujinaga, Yukiko Yamauchi, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
- SIAM J. Comput.
- 2015

- Shuji Kijima, Tomomi Matsui
- Annals OR
- 2008

In this paper, we propose a fully polynomial-time randomized approximation scheme (FPRAS) for the closed Jackson network. Our algorithm is based on Markov chain Monte Carlo (MCMC) method. Thus, our scheme returns an approximate solution, of which the size of error satisfies a given error rate. To our knowledge, the algorithm is the first polynomial time… (More)

- Shuji Kijima, Hiromasa Kijima
- Journal of theoretical biology
- 1987

A general stochastic theory is presented for analysis of current records of a patch containing an arbitrary number (N) of independent homologous channels in the steady-state. We give the "basic theorem" that at the instant of any open (or shut) transition of a channel, the other N-1 channels are located in each state with a probability equal to those in the… (More)

- Nao Fujinaga, Hirotaka Ono, Shuji Kijima, Masafumi Yamashita
- OPODIS
- 2010

- Shuji Kijima, Kentaro Koga, Kazuhisa Makino
- ANALCO
- 2012

The rotor-router model, also known as the Propp machine, is a deterministic process analogous to a random walk on a graph [1]. Instead of distributing tokens to randomly chosen neighbors, the rotor-router model deterministically serves the neighbors in a fixed order by associating to each vertex a “rotor-router” pointing to one of its neighbors. The… (More)

- Shuji Kijima, Masashi Kiyomi, Yoshio Okamoto, Takeaki Uno
- Theor. Comput. Sci.
- 2008

We discuss the problems to list, sample, and count the chordal graphs with edge constraints. The edge constraints are given as a pair of graphs one of which contains the other and one of which is chordal, and the objects we look at are the chordal graphs contained in one and containing the other. This setting is a natural generalization of chordal… (More)

- Satoru Iwata, Naoyuki Kamiyama, Naoki Katoh, Shuji Kijima, Yoshio Okamoto
- Math. Program.
- 2016

We show the existence of a polynomial-size extended formulation for the base polytope of a (k, l)-sparsity matroid. For an undirected graph G = (V,E), the size of the formulation is O(|V ||E|) when k ≥ l and O(|V ||E|) when k ≤ l. To this end, we employ the technique developed by Faenza et al. recently that uses a randomized communication protocol.