Information and Systems-Theoretical Foundations of Computing(Date:1999/09/06)

Presentation
表紙

,  

[Date]1999/9/6
[Paper #]
目次

,  

[Date]1999/9/6
[Paper #]
Computational Complexity of Finding Meaningful Association Rules from Large Itemsets

Teppei Matsuyama,  Kotaro Nonaka,  Ryuichi Nakanishi,  Minoru Ito,  Michio Nakanishi,  

[Date]1999/9/6
[Paper #]COMP99-31
An Incremental Algorithm to Search for Meaningful Association Rules from Large Itemsets

Kotaro Nonaka,  Ryuichi Nakanishi,  Minoru Ito,  Michio Nakanishi,  

[Date]1999/9/6
[Paper #]COMP99-32
On the Size of the Tree-Like Resolution for the Pigeonhole Principle

Shuichi Miyazaki,  Kazuo Iwama,  

[Date]1999/9/6
[Paper #]COMP99-33
A polynomial time algorithm to determine the highest degree of the Jones polynomial or a certain pretzel link

Masao Hara,  Sei'ichi Tani,  Makoto Yamamoto,  

[Date]1999/9/6
[Paper #]COMP99-34
A 2-packing of three 3-based graphs in a 3-connected graph

Hiroshi Nagamochi,  Katsuhiro Seki,  Toshihide Ibaraki,  

[Date]1999/9/6
[Paper #]COMP99-35
The Seq-Table: Stochastic Approach to an Optimum Packing of Convex-Polygon Blocks

Keishi Sakanushi,  Hiroyuki Yamazaki,  Hidenori Shimakura,  Shigetoshi Nakatake,  Yoji Kajitani,  

[Date]1999/9/6
[Paper #]COMP99-36
Wait-Free Linearizable Implementation of a Distributed Shared Memory

Sen MORIYA,  Katsuro SUDA,  Michiko INOUE,  Toshimitsu MASUZAWA,  Hideo FUJIWARA,  

[Date]1999/9/6
[Paper #]COMP99-37
A Visualization System of Parallel Algorithms on Reconfigurable Mesh by Java Applet

Kensuke Miyashita,  Reiji Hashimoto,  

[Date]1999/9/6
[Paper #]COMP99-38
[OTHERS]

,  

[Date]1999/9/6
[Paper #]