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

Presentation
表紙

,  

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

,  

[Date]2002/4/18
[Paper #]
An Explicit Lower Bound of 5n-o(n) for Boolean Circuits

Kazuo IWAMA,  Hiroki MORIZUMI,  

[Date]2002/4/18
[Paper #]COMP2002-1
A4/3-Approximation for the Minimum 2-Local-Vertex-Connectivity Augmentation in a Connected Graph

Hiroshi NAGAMOCHI,  

[Date]2002/4/18
[Paper #]COMP2002-2
New Secure Index for the Digital Fingerprinting and its Bounds

Shingo ORIHARA,  Takaaki MIZUKI,  Takao NISHIZEKI,  

[Date]2002/4/18
[Paper #]COMP2002-3
Automatic generation of a Boyer-Moore type pattern matcher from a naive pattern matcher

Yoshihiko FUTAMURA,  Zenjiro KONISHI,  

[Date]2002/4/18
[Paper #]COMP2002-4
Incremental Dependency Parsing Based on Headed Context Free Grammar

Yoshihide KATO,  Shigeki MATSUBARA,  Katsuhiko TOYAMA,  Yasuyoshi INAGAKI,  

[Date]2002/4/18
[Paper #]COMP2002-5
On the Distance between Monotone Boolean Functions

Kazuyuki AMANO,  Akira MARUOKA,  

[Date]2002/4/18
[Paper #]COMP2002-6
Path Kernels and Multiplicative Updates

Eiji TAKIMOTO,  Manfred WARMUTH,  

[Date]2002/4/18
[Paper #]COMP2002-7
Randomized Time- and Energy-Optimal Routing in Single-Hop, Single-Channel Radio Networks

Jacir L. BORDIM,  Jiangtao CUI,  Koji NAKANO,  

[Date]2002/4/18
[Paper #]COMP2002-8
[OTHERS]

,  

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