Information and Systems-Theoretical Foundations of Computing(Date:2004/10/08)

Presentation
表紙

,  

[Date]2004/10/8
[Paper #]
目次

,  

[Date]2004/10/8
[Paper #]
Tiling Problems with the Edge-Ovewriting Rule

Kazuo IWAMA,  Kosuke IZUMI,  Eiji MIYANO,  Hirotaka ONO,  

[Date]2004/10/8
[Paper #]COMP2004-43
Mining Frequent Trees with Node-Inclusion Constraints

Atsuyoshi NAKAMURA,  Mineichi KUDO,  

[Date]2004/10/8
[Paper #]COMP2004-44
An Effcient Algorithm for Mining Frequent Closed Sequential Episodes

Hiroki ARIMURA,  Takeaki UNO,  

[Date]2004/10/8
[Paper #]COMP2004-45
Algorithm Aspect of Graph Minor Theory

Ken-ichi KAWARABAYASHI,  

[Date]2004/10/8
[Paper #]COMP2004-46
Odd-Even Transposition Sort and Shear Sort Algorithm with DNA strands

Mizue USHIJIMA,  Akihiro FUJIWARA,  

[Date]2004/10/8
[Paper #]COMP2004-47
A Polylogarithmic Sorting Algorithm with DNA Strands

Shoichi ASHIZUKA,  Akihiro FUJIWARA,  

[Date]2004/10/8
[Paper #]COMP2004-48
A Local Search Algorithm for Barrier Heights Estimation in DNA computing

Tsutomu TAKEDA,  Hirotaka ONO,  Kunihiko SADAKANE,  Masafumi YAMASHITA,  

[Date]2004/10/8
[Paper #]COMP2004-49
Experimental Study of Compressed Full-Text Index Construction

Kunihiko SADAKANE,  

[Date]2004/10/8
[Paper #]COMP2004-50
An algorithm for computing the Holevo capacity of 1-qubit channel with using computational geometry

Mayumi OTO,  Hiroshi IMAI,  Keiko IMAI,  

[Date]2004/10/8
[Paper #]COMP2004-51
複写される方へ

,  

[Date]2004/10/8
[Paper #]
奥付

,  

[Date]2004/10/8
[Paper #]