| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2008)
Search Results: Keywords 'from:2009-03-02 to:2009-03-02'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2009-03-02 09:10 |
Tokyo | Tokyo Institute of Technology | Generating NPN-representatives of a Set of Optimal Boolean Formulas Hideaki Fukuhara (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Kazuyuki Amano (Gunma Univ.)  COMP2008-54 |
For $k$ variable function $h$ and $k$ functions $g_1, \ldots, g_k$, $f = h \circ (g_1, \ldots, g_k)$denotes a composit... [more] |
COMP2008-54 pp.1-8 |
| COMP | 2009-03-02 09:45 |
Tokyo | Tokyo Institute of Technology | An Algorithm to Test Square-Freeness of BSLP-Compressed Strings Wataru Matsubara (Tohoku Univ.), Shunsuke Inenaga (Kyushu Univ.), Ayumi Shinohara (Tohoku Univ.) COMP2008-55 |
Balanced Straight line programs(BSLPs) is one of the most powerful and general compression schemes. An BSLP is a context... [more] | COMP2008-55 pp.9-16 |
| COMP | 2009-03-02 10:35 |
Tokyo | Tokyo Institute of Technology | Efficient Enumeration of All Ladder Lotteries Katsuhisa Yamanaka (Univ. of Electro-Comm.), Shin-ichi Nakano (Gunma Univ.), Yasuko Matsui (Tokai Univ.), Ryuhei Uehara (JAIST), Kento Nakada (Kyoto Univ.) COMP2008-56 |
A ladder lottery, known as the "Amidakuji" in Japan, is a common way to choose a random permutation. Given a permutation... [more] | COMP2008-56 pp.17-23 |
| COMP | 2009-03-02 11:10 |
Tokyo | Tokyo Institute of Technology | Factorization of Generalized de Bruijn and Kautz Digraphs using Loop-Rooted Trees Takahiro Tsuno, Yukio Shibata (Gunma Univ.) COMP2008-57 |
In this research, we present several factorizations of generalized de Bruijn digraphs and generalized Kautz digraphs bas... [more] | COMP2008-57 pp.25-32 |
| COMP | 2009-03-02 13:00 |
Tokyo | Tokyo Institute of Technology | [Invited Talk]
Peformance analysis of error correcting codes Kenji Yasunaga (Tokyo Inst. of Tech.) COMP2008-58 |
[more] | COMP2008-58 p.33 |
| COMP | 2009-03-02 14:15 |
Tokyo | Tokyo Institute of Technology | On generalized categorial grammars and tree adjoining grammars Shunichi Matsubara (Univ. of Electro-Comm.) COMP2008-59 |
In this paper, we introduce a formal grammatical model called generalized categorial grammars. This model is used in an ... [more] | COMP2008-59 pp.35-40 |
| COMP | 2009-03-02 14:50 |
Tokyo | Tokyo Institute of Technology | Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries Yasuhiro Tajima, Yoshiyuki Kotani (Tokyo Univ. of Agri. & Tech.) COMP2008-60 |
We show a probabilistic learnability of a subclass of linear languages with queries. Learning via queries is an importa... [more] |
COMP2008-60 pp.41-47 |
| COMP | 2009-03-02 15:40 |
Tokyo | Tokyo Institute of Technology | An Efficient Flooding Scheme Using Discrete Particle Swarm Optimization in Wireless Sensor Networks Junya Nagashima, Akihide Utani, Hisao Yamamoto (Musashi Inst. of Tech.) COMP2008-61 |
Wireless sensor networks have a wide range of applications, such as environmental monitoring, environmental control, and... [more] | COMP2008-61 pp.49-52 |
| COMP | 2009-03-02 16:15 |
Tokyo | Tokyo Institute of Technology | Adaptive and Efficient Routng Algorithm for Mobile Ad-Hoc Sensor Networks Eisuke Orito, Akihide Utani, Hisao Yamamoto (Musashi Inst. of Tech.) COMP2008-62 |
There is growing expectation for new network services by wireless sensor networks and mobile robots. Wireless sensor net... [more] | COMP2008-62 pp.53-58 |
[Return to Top Page]