| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2007)
Search Results: Keywords 'from:2007-05-25 to:2007-05-25'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2007-05-25 10:40 |
Fukuoka | Kyushu University | On Approximation of Bookmark Assignments Yuichi Asahiro (Kyushu Sangyo Univ.), Eiji Miyano (Kyushu Inst of Tech), Hirotaka Ono (Kyushu Univ.), Toshihide Murata (Kyushu Inst of Tech)  COMP2007-11 |
[more] | COMP2007-11 pp.1-6 |
| COMP | 2007-05-25 11:15 |
Fukuoka | Kyushu University | On noise-reduction effect of filters for Boolean functions Masashi Karasaki, Eiji Takimoto (Tohoku Univ.) COMP2007-12 |
[more] | COMP2007-12 pp.7-12 |
| COMP | 2007-05-25 13:20 |
Fukuoka | Kyushu University | An O(1.787^n)-time Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes Takeyuki Tamura, Tatsuya Akutsu (Kyoto Univ.) COMP2007-13 |
The Boolean network (BN) is a mathematical model of genetic networks. It is known that detecting a singleton attractor i... [more] | COMP2007-13 pp.13-18 |
| COMP | 2007-05-25 13:55 |
Fukuoka | Kyushu University | Optimal Highway Location Problem Matias Korman, Takeshi Tokuyama (Tohoku Univ.) COMP2007-14 |
Given two sets of points in the plane, we are interested in locating a highway $h$ such that an objective function on th... [more] | COMP2007-14 pp.19-24 |
| COMP | 2007-05-25 14:30 |
Fukuoka | Kyushu University | Fixed-Parameter Tractability for Non-Crossing Spanning Trees Magnus Halldorsson (Univ. of Iceland), Christian Knauer (Freie U.), Andreas Spillner (U. East Anglia), Takeshi Tokuyama (Tohoku U) COMP2007-15 |
We consider the problem of computing non-crossing spanning trees in topological graphs. It is known that it is NP-... [more] |
COMP2007-15 pp.25-30 |
| COMP | 2007-05-25 15:20 |
Fukuoka | Kyushu University | A dynamic programming algorithm for computing automorphism group of a giveｎ set of matrices Seinosuke Toda (Nihon Univ.) COMP2007-16 |
[more] | COMP2007-16 pp.31-36 |
| 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 |
[Return to Top Page]