| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2010)
Search Results: Keywords 'from:2010-09-29 to:2010-09-29'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2010-09-29 10:00 |
Niigata | Nagaoka Univ. of Tech. | Run-time Analysis of Ant Colony Optimization over the Cheapest Path with a Context-dependent Cost Atsushi Murata, Yoshinori Takei (Nagaoka Univ. of Tech.)  COMP2010-24 |
Since Ant Colony Optimization (ACO) was introduced by Dorigo and his colleagues in the early 1990s, it has been worked a... [more] | COMP2010-24 pp.1-8 |
| COMP | 2010-09-29 10:35 |
Niigata | Nagaoka Univ. of Tech. | Minimum Cost Edge-Colorings of Trees Can be Reduced to Matchings Takehiro Ito, Naoki Sakamoto, Xiao Zhou (Tohoku Univ.), Takao Nishizeki (Kwansei Gakuin Univ.) COMP2010-25 |
[more] | COMP2010-25 pp.9-15 |
| COMP | 2010-09-29 11:10 |
Niigata | Nagaoka Univ. of Tech. | In-place algorithm for Erasing a Component in a Binary Image Tetsuo Asano (JAIST) COMP2010-26 |
Removing noises in a given binary image is one of common operations. A generalization of the operation is to erase an... [more] |
COMP2010-26 pp.17-23 |
| COMP | 2010-09-29 13:30 |
Niigata | Nagaoka Univ. of Tech. | Counting and Verifying Maximal Palindromes Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2010-27 |
A palindrome is a symmetric string that reads the same forward and backward. Let $\pals(w)$ denote the set of maximal pa... [more] | COMP2010-27 pp.25-30 |
| COMP | 2010-09-29 14:05 |
Niigata | Nagaoka Univ. of Tech. | A method to construct a compact automata from regular expressions Toshinori Sakata, Hiroaki Yamamoto (Shinshu Univ.) COMP2010-28 |
[more] | COMP2010-28 pp.31-38 |
| COMP | 2010-09-29 15:10 |
Niigata | Nagaoka Univ. of Tech. | Considerations on static graphs of periodic graphs Akihiro Hashikura, Norie Fu, Hiroshi Imai (Tokyo Univ.) COMP2010-29 |
Periodic graphs are infinite graphs, which have repetitive structures. They are called static graphs.Chavey enumerated e... [more] | COMP2010-29 pp.39-43 |
| COMP | 2010-09-29 15:45 |
Niigata | Nagaoka Univ. of Tech. | Neighbor Systems
-- Algorithms and the Relationship with Jump Systems and Bisubmodular Polyhedra -- Akiyoshi Shioura (Tohoku Univ.) COMP2010-30 |
[more] | COMP2010-30 pp.45-52 |
[Return to Top Page]