| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2008)
Search Results: Keywords 'from:2008-04-18 to:2008-04-18'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2008-04-18 10:00 |
Osaka | Osaka Prefecture University | Constant-Working Space Algorithm for Connected Components Labeling Tetsuo Asano, Hiroshi Tanaka (JAIST)  COMP2008-1 |
Connected components labeling of a binary image is one of the most fundamental operations in image processing. This pa... [more] |
COMP2008-1 pp.1-8 |
| COMP | 2008-04-18 10:35 |
Osaka | Osaka Prefecture University | Constant-Working-Space Algorithm for Euclidean Distance Transform Tetsuo Asano, Hiroshi Tanaka (JAIST) COMP2008-2 |
Given a binary image, Euclidean distance transform is to compute for each pixel the Euclidean distance to the closest ... [more] |
COMP2008-2 pp.9-14 |
| COMP | 2008-04-18 11:10 |
Osaka | Osaka Prefecture University | Enumeration of Perfect Sequences of Chordal Graph Yasuko Matsui (Tokai Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2008-3 |
A graph is chordal if and only if it has no chordless cycle of length more than three. The set of maximal cliques in a ... [more] |
COMP2008-3 pp.15-22 |
| COMP | 2008-04-18 13:30 |
Osaka | Osaka Prefecture University | Complexity Theoretic Characterization of Quantum One-Way Permutations Kouji Tohda, Takeshi Koshiba (Saitama Univ.) COMP2008-4 |
In this paper we discuss about the existence of quantum one-way permutation, from the viewpoint of complexity theory. ... [more] | COMP2008-4 pp.23-28 |
| COMP | 2008-04-18 14:05 |
Osaka | Osaka Prefecture University | Quantum Isomorphism Testing for Semidirect Product Groups Yoshifumi Inui (JST/ Univ. of Tokyo), Francois Le Gall (JST) COMP2008-5 |
The group isomorphism problem asks whether two given groups are isomorphic or not, a problem closely connected to the gr... [more] | COMP2008-5 pp.29-34 |
| COMP | 2008-04-18 14:55 |
Osaka | Osaka Prefecture University | Learning Walks from Graphs Junpei Tsutsui, Hiroki Arimura (Hokkaido Univ.) COMP2008-6 |
In this paper, we study the problem of learning an unknown label sequence, called a walk, that is embedded in a collecti... [more] | COMP2008-6 pp.35-40 |
| COMP | 2008-04-18 15:30 |
Osaka | Osaka Prefecture University | The Lower Bound on the Stabilization Time of Dijkstra's Three State Mutual Exclusion Algorithm Masahiro Kimoto, Tatsuhiro Tsuchiya, Tohru Kikuno (Osaka Univ.) COMP2008-7 |
The three state mutual exclusion algorithm is the first self-stabilizing algorithm which was proposed by E. W. Dijkstra.... [more] | COMP2008-7 pp.41-47 |
[Return to Top Page]