| Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
| COMP |
2004-10-14
10:30 |
Miyagi |
Tohoku University |
Inner Rectangular Drawings of Plane Graphs
Kazuyuki Miura, Hiroki Haga, Takao Nishizeki (Tohoku Univ) |
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical lin... [more] |
COMP2004-35
pp.1-8 |
| COMP |
2004-10-14
11:00 |
Miyagi |
Tohoku University |
On the t-Safety of Key-sharing Graphs
Yasuhito Asano, Takaaki Mizuki, Takao Nishizeki (Tohoku Univ.) |
[more] |
COMP2004-36
pp.9-16 |
| COMP |
2004-10-14
11:30 |
Miyagi |
Tohoku University |
Approximation algorithms for the bipartite dense subgraph problem
Akiko Suzuki, Takeshi Tokuyama (Tohoku Univ.) |
We consider the (weighted) bipartite dense subgraph problem that extracts a dense subgraph of a given (weighted) biparti... [more] |
COMP2004-37
pp.17-24 |
| COMP |
2004-10-14
13:30 |
Miyagi |
Tohoku University |
[Tutorial Lecture]
Kazuyuki Tanaka (Tohoku Univ.) |
[more] |
COMP2004-38
pp.25-32 |
| COMP |
2004-10-14
14:45 |
Miyagi |
Tohoku University |
Boosting Based on Divide and Merge
Eiji Takimoto, Syuhei Koya, Akira Maruoka (Tohoku Univ.) |
[more] |
COMP2004-39
pp.33-40 |
| COMP |
2004-10-14
15:15 |
Miyagi |
Tohoku University |
On the Monotone Circuit Complexity of Quadratic Boolean Functions
Kazuyuki Amano, Akira Maruoka (Tohoku Univ.) |
[more] |
COMP2004-40
pp.41-47 |
| COMP |
2004-10-14
15:45 |
Miyagi |
Tohoku University |
Multicoloring Unit Disk Graphs on Triangular Lattice Points
Yuichiro Miyamoto (Sophia Univ.), Tomomi Matsui (Univ. Tokyo) |
In this paper, we discuss a necessary and sufficient condition that the unit disk graph on triangular lattice points is ... [more] |
COMP2004-41
pp.49-54 |
| 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 |
| COMP |
2004-10-14
16:45 |
Miyagi |
Tohoku University |
An Effcient Mining Algorithm for Frequent Closed Sequential Episodes
Hiroki Arimura (Hokkaido Univ.), Takeaki Uno (NII) |
In this paper, we consider the enumeration problem for
the class of frequent closed sequence patterns, called frequent... [more] |
COMP2004-45
pp.15-22 |
| COMP |
2004-10-15
10:30 |
Miyagi |
Tohoku University |
Tiling Problems with the Edge-Overwriting Rule
Kazuo Iwama (Kyoto Univ.), Kousuke Izumi, Eiji Miyano (Kyushu Inst. Tech.), Hirotaka Ono (Kyushu Univ.) |
Ordinary tiling problems using 1x1 squares with colored edges
(say Wang tiles) assume that if two tiles touch then the... [more] |
COMP2004-43
pp.1-5 |
| COMP |
2004-10-15
11:00 |
Miyagi |
Tohoku University |
Mining Frequent Trees with Node-Inclusion Constraints
Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) |
In this paper, we propose an efficient algorithm enumerating all frequent subtrees containing all special nodes that are... [more] |
COMP2004-44
pp.7-14 |
| COMP |
2004-10-15
11:30 |
Miyagi |
Tohoku University |
Experimental Study of Compressed Full-Text Index Construction
Kunihiko Sadakane (Kyushu Univ.) |
Compressed full-text indices are data structures for string matching
and they can search for any pattern quickly. Thou... [more] |
COMP2004-50
pp.47-54 |
| COMP |
2004-10-15
13:30 |
Miyagi |
Tohoku University |
[Tutorial Lecture]
Algorithm Aspect of Graph Minor Theory
Ken-ichi Kawarabayashi (Tohoku Univ.) |
We shall survey recent progress on algorithm aspect of graph minor theory.
One of the main results on Graph Minor Proj... [more] |
COMP2004-46
p.23 |
| COMP |
2004-10-15
14:45 |
Miyagi |
Tohoku University |
Mizue Ushijima, Akihiro Fujiwara (Kyushu Inst. Tech.) |
In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has considerable... [more] |
COMP2004-47
pp.25-32 |
| COMP |
2004-10-15
15:05 |
Miyagi |
Tohoku University |
() |
In this paper, we propose a polylogarithmic procedure for sorting of $n$ elements. An input of the procedure is a set of... [more] |
COMP2004-48
pp.33-40 |
| 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 |
| COMP |
2004-10-15
15:55 |
Miyagi |
Tohoku University |
An algorithm for computing the Holevo capacity of 1-qubit channel with using computational gemetry
Mayumi Oto, Hiroshi Imai (Univ. of Tokyo), Keiko Imai (Chuo Univ.) |
Let a parameter space of qubits be a quantum space.
In this space, computational-geometric problems can be treated for ... [more] |
COMP2004-51
pp.55-59 |