|
|
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2008)
|
|
Search Results: Keywords 'from:2008-05-13 to:2008-05-13'
|
[Go to Official COMP Homepage (Japanese)] |
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Ascending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2008-05-13 10:40 |
Fukuoka |
Kyushu Sangyo University |
NP-Hardness of the Sorting Buffer Problem on the Unifrom Metric Yuichi Asahiro (Kyushu Sangyo Univ.), Kenichi Kawahara, Eiji Miyano (Kyushu Inst of Tech) COMP2008-8 |
[more] |
COMP2008-8 pp.1-8 |
COMP |
2008-05-13 11:15 |
Fukuoka |
Kyushu Sangyo University |
Minimum Energy Broadcasting on Wireless Networks in Manhattan Model Toshinori Yamada (Saitama Univ.) COMP2008-9 |
This paper considers a special case of MECBS(Minimum Energy Consumption
Broadcast Subgraph) problem, which is motivate... [more] |
COMP2008-9 pp.9-16 |
COMP |
2008-05-13 13:20 |
Fukuoka |
Kyushu Sangyo University |
GMDH-type neural network algorithm self-selecting optimum neural network architecture and its application to medical image recognition Tadashi Kondo (Tokushima Univ.) COMP2008-10 |
In this study, a revised Group Method of Data Handling (GMDH)-type neural network self-selecting optimum neural network ... [more] |
COMP2008-10 pp.17-24 |
COMP |
2008-05-13 13:55 |
Fukuoka |
Kyushu Sangyo University |
NP-Completeness of Planar n/k-Coloring Problems for n/k Between 3 and 4 Masakazu Shoji, Akihiro Uejima (Osaka Electro-Communication Univ.) COMP2008-11 |
This report considers the $n/k$-coloring problem, which is a subproblem for the $H$-coloring problem, where $H$ is a sim... [more] |
COMP2008-11 pp.25-32 |
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 |
2008-05-13 15:20 |
Fukuoka |
Kyushu Sangyo University |
Improved approximation of the Largest common Sub-tree of Two Unordered Trees of Bounded Height Tatsuya Akutsu (Kyoto Univ.), Daiji Fukagawa, Atsuhiro Takasu (NII) COMP2008-13 |
Finding similarities in tree structured data is important for such areas as computational biology, XML databases and ima... [more] |
COMP2008-13 pp.37-42 |
COMP |
2008-05-13 15:55 |
Fukuoka |
Kyushu Sangyo University |
An O(n^{1.75})-time Algorithm for L(2,1)-labeling of Trees Toru Hasunuma (Univ. Tokushima), Toshimasa Ishii (Otaru Univ. of Commerce), Hirotaka Ono (Kyushu Univ.), Yushi Uno (Osaka Prefecture Univ.) COMP2008-14 |
An $L(2,1)$-labeling of a graph $G$ is an assignment $f$
from the vertex set $V(G)$ to the set of nonnegative integers... [more] |
COMP2008-14 pp.43-50 |
|
|
|
Copyright and reproduction :
All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
|
[Return to Top Page]
[Return to IEICE Web Page]
|