Information and Systems-Theoretical Foundations of Computing(Date:1998/05/29)

Presentation
表紙

,  

[Date]1998/5/29
[Paper #]
目次

,  

[Date]1998/5/29
[Paper #]
A Subclass of Databases whose Large Itemsets Can Be Computed Efficiently

Yeon-Dae Kwon,  Ryuichi Nakanishi,  Minoru Ito,  Michio Nakanishi,  

[Date]1998/5/29
[Paper #]
A Linear-Time Algorithm to find Four Independent Spanning Trees in Four-Connected Planar Graphs

Kazuyuki Miura,  Daishiro Takahashi,  Shin-ichi Nakano,  Takao Nishizeki,  

[Date]1998/5/29
[Paper #]
An Approximation of the Minimum Vertex Cover

Hiroshi Nagamochi,  Toshihide Ibaraki,  

[Date]1998/5/29
[Paper #]
Hardware Algorithm for Computing Euclidean Distance

Seiji KUWAHARA,  Naofumi TAKAGI,  

[Date]1998/5/29
[Paper #]
Code Scheduling for Multi Processors

Yoshikazu MATSUBARA,  Michio OYAMAGUCHI,  Yoshikatsu OHTA,  

[Date]1998/5/29
[Paper #]
[OTHERS]

,  

[Date]1998/5/29
[Paper #]