Information and Systems-Theoretical Foundations of Computing(Date:2002/03/04)

Presentation
表紙

,  

[Date]2002/3/4
[Paper #]
目次

,  

[Date]2002/3/4
[Paper #]
Polynomial Time Identification in the Limit of Regular Languages in Some Subclass from Positive Data

Tomokazu YOSHINARI,  Etsuji TOMITA,  Mitsuo WAKATSUKI,  

[Date]2002/3/4
[Paper #]COMP2001-83
On computational complexity of conjugacy problem for braid groups

Toshitaka TANABE,  Masao HARA,  Makoto YAMAMOTO,  Sei'ichi TANI,  

[Date]2002/3/4
[Paper #]COMP2001-84
Application of Graph Grammars to Program Diagrams and Tabular Form Processing

Tomokazu ARITA,  Kensei TSUCHIDA,  Kimio SUGITA,  Takeo YAKU,  

[Date]2002/3/4
[Paper #]COMP2001-85
A Hichart editor based on attribute graph grammars

Akito Kanai,  

[Date]2002/3/4
[Paper #]COMP2001-86
Algorithms for Tree Partitioning

Masanori KABAKURA,  Xiao ZHOU,  Takao NISHIZEKI,  

[Date]2002/3/4
[Paper #]COMP2001-87
Bend-Optimal Orthogonal Drawings of Plane 3-Graphs

Md. Saidur Raliman,  Takao Nishizeki,  

[Date]2002/3/4
[Paper #]COMP2001-88
On the Recurrent Intervals of Complete Graphs and Complete Bipartite Graphs

Shuji JIMBO,  Kosaburo HASHIGUCHI,  Mei HAN,  

[Date]2002/3/4
[Paper #]COMP2001-89
On the property of Boolean functions for testing monomiality

Masaya HOTTA,  Kazuyuki AMANO,  Akira MARUOKA,  

[Date]2002/3/4
[Paper #]COMP2001-90
The Relationship between Fourier Spectrum and Nonlinearity of Boolean Functions

Masaki TABUCHI,  Kazuyuki AMANO,  Akira MARUOKA,  

[Date]2002/3/4
[Paper #]COMP2001-91
Dimensionality Reduction by Random Projection

Tatsuya WATANABE,  Eiji TAKIMOTO,  Akira MARUOKA,  

[Date]2002/3/4
[Paper #]COMP2001-92
[OTHERS]

,  

[Date]2002/3/4
[Paper #]