|
|
|
|
|
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2005)
|
|
|
|
Search Results: Keywords 'from:2005-05-20 to:2005-05-20'
|
| [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 |
2005-05-20
10:15 |
Fukuoka |
Kyushu Univ. |
Effient Indexing and Updating of Text Databases
Takamoto Goto, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) |
[more] |
COMP2005-9
pp.1-8 |
| COMP |
2005-05-20
10:50 |
Fukuoka |
Kyushu Univ. |
Hardness of Pickup and Delivery for Moving Objects on Broken Lines
Yuichi Asahiro (Kyushu Sangyo Univ.), Eiji Miyano, Shinichi Shimoirisa (Kyushu Inst. of Tech.) |
[more] |
COMP2005-10
pp.9-16 |
| COMP |
2005-05-20
11:25 |
Fukuoka |
Kyushu Univ. |
Hardness and an Approximation Algorithm for Minimum Certificate Dispersal Problems
Hua Zheng, Shingo Omura, Koichi Wada (Nagoya Inst. of Tech.) |
[more] |
COMP2005-11
pp.17-24 |
| COMP |
2005-05-20
13:30 |
Fukuoka |
Kyushu Univ. |
Recognition of Tree-Shellable Boolean Functions with Restrictions to the Number of the Same Literal
Nao Katougi, Yasuhiko Takenaga (UEC) |
A tree-shellable function is a positive Boolean function which can be representation by a binary decision tree such that... [more] |
COMP2005-12
pp.25-30 |
| COMP |
2005-05-20
14:05 |
Fukuoka |
Kyushu Univ. |
VSOP: Valued-Sum-Of-Products Calculator Based on Zero-Suppressed BDDs
Shin-ichi Minato (Hokkaido Univ.) |
Recently, Binary Decision Diagrams (BDDs) are widely used for manipulating large-scale Boolean function data. Zero-suppr... [more] |
COMP2005-13
pp.31-38 |
| COMP |
2005-05-20
14:40 |
Fukuoka |
Kyushu Univ. |
PUYOPUYO is NP-Complete
Hidetoshi Muta (Univ. of Tokyo) |
[more] |
COMP2005-14
pp.39-44 |
| COMP |
2005-05-20
15:30 |
Fukuoka |
Kyushu Univ. |
Improving a local search approximation algorithm for the stable marriage problem
Naoya Yamauchi, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) |
We consider the problem of finding a stable matching of maximum size when both ties and unacceptable partners are allowe... [more] |
COMP2005-15
pp.45-51 |
| COMP |
2005-05-20
16:05 |
Fukuoka |
Kyushu Univ. |
Constant Time Generation of Linear Extensions
Akimitsu Ono, Shin-ichi Nakano (Gunma Univ.) |
Given a poset P,
several algorithms have been proposed
for generating all linear extensions of P.
The fastest known a... [more] |
COMP2005-16
pp.53-57 |
| COMP |
2005-05-20
16:40 |
Fukuoka |
Kyushu Univ. |
Experimental Evaluation of Automata-Based Extended Regular Expression Matching Algorithms
Hiroaki Yamamoto (Shinshu Univ.) |
[more] |
COMP2005-17
pp.59-66 |
|
|
|
|
|
[Return to Top Page]
[Return to IEICE Web Page]
|