IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

Technical Committee on Theoretical Foundations of Computing (COMP)  (2005)

Chair: Toshimitsu Masuzawa (Osaka Univ.) Vice Chair: Hirotaka Ono (Nagoya Univ)
Secretary: Fukuhito Ooshita (NAIST), Ei Ando (Senshu Univ.)
Assistant: Yota Otachi (Nagoya Univ)

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)
 Results 1 - 9 of 9  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2005-05-20
Fukuoka Kyushu Univ. Effient Indexing and Updating of Text Databases
Takamoto Goto, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.)
 [more] COMP2005-9
COMP 2005-05-20
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
COMP 2005-05-20
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
COMP 2005-05-20
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
COMP 2005-05-20
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
COMP 2005-05-20
Fukuoka Kyushu Univ. PUYOPUYO is NP-Complete
Hidetoshi Muta (Univ. of Tokyo)
 [more] COMP2005-14
COMP 2005-05-20
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
COMP 2005-05-20
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]
COMP 2005-05-20
Fukuoka Kyushu Univ. Experimental Evaluation of Automata-Based Extended Regular Expression Matching Algorithms
Hiroaki Yamamoto (Shinshu Univ.)
 [more] COMP2005-17
 Results 1 - 9 of 9  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan