Information and Systems-Theoretical Foundations of Computing(Date:2004/01/22)

Presentation
表紙

,  

[Date]2004/1/22
[Paper #]
目次

,  

[Date]2004/1/22
[Paper #]
Variants of the Graph Connecting Problem and Their Computational Complexity

Taishi NISHIDA,  Etsuro MORIYA,  

[Date]2004/1/22
[Paper #]COMP2003-69
Learning AC^0 Boolean Functions on Attribute and Label Noise

Akinobu MIYATA,  Jun TARUI,  Etsuji TOMITA,  

[Date]2004/1/22
[Paper #]COMP2003-70
Approximate Point Pattern Matching towards Musical Sequence Search

Tomoaki SUGA,  Shinichi SHIMOZONO,  

[Date]2004/1/22
[Paper #]COMP2003-71
A Space-Economical Approximation Algorithm for Grammar-Based Compression

Hiroshi SAKAMOTO,  

[Date]2004/1/22
[Paper #]COMP2003-72
Linear Time Algorithm for Text Compression by Longest-First Substitution

Shunsuke INENAGA,  Takashi FUNAMOTO,  Masayuki TAKEDA,  Ayumi SHINOHARA,  

[Date]2004/1/22
[Paper #]COMP2003-73
省スペースな全文索引とその構築アルゴリズム(<特集>文字列アルゴリズム)

,  

[Date]2004/1/22
[Paper #]
On the Generative Power of Grammars for RNA Secondary Structure

Yuki KATO,  Hiroyuki SEKI,  Tadao KASAMI,  

[Date]2004/1/22
[Paper #]COMP2003-75
Profile Alignment with Constraints

Tatsuya AKUTSU,  Morihiro HAYASHIDA,  Etsuji TOMITA,  Jun'ichi SUZUKI,  Katsuhisa HORIMOTO,  

[Date]2004/1/22
[Paper #]COMP2003-76
An Efficient Algorithm for Computing Mismatch Tolerance of Substrings

Takeaki UNO,  

[Date]2004/1/22
[Paper #]COMP2003-77
VLDC Pattern Matching Algorithm with Arrowing Errors

Takuya KIDA,  

[Date]2004/1/22
[Paper #]COMP2003-78
Formulation of Template Discovery Problem and an Algorithm using Substring Amplification

Daisuke IKEDA,  Yasuhiro YAMADA,  Sachio HIROKAWA,  

[Date]2004/1/22
[Paper #]COMP2003-79
Efficiently Mining Frequent Substructures from Large Unordered Trees

Tatsuya ASAI,  ARIMURA Hiroki /,  Takeaki UNO,  Shin-ichi NAKANO,  

[Date]2004/1/22
[Paper #]COMP2003-80
複写される方へ

,  

[Date]2004/1/22
[Paper #]
奥付

,  

[Date]2004/1/22
[Paper #]