| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2012)
Search Results: Keywords 'from:2012-09-03 to:2012-09-03'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2012-09-03 09:30 |
Tokyo | Hosei University | Permuted Pattern Matching and Indexing Structure for Multi-Track Strings Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.), Hideo Bannai, Shunsuke Inenaga (Kyushu Univ.)  COMP2012-26 |
We propose a new variant of pattern matching on a multi-set of strings, or multi-tracks, called permuted-matching, tha... [more] |
COMP2012-26 pp.1-8 |
| COMP | 2012-09-03 10:05 |
Tokyo | Hosei University | Bit-Parallel Algorithms for Finding All Substrings Matching a Regular Expression Hiroaki Yamamoto (Shinshu Univ.), Takashi Miyazaki (Nagano National College of Tech.) COMP2012-27 |
This paper is concerned with the following regular expression searching problem which, given a regular expression $r$ ... [more] |
COMP2012-27 pp.9-16 |
| COMP | 2012-09-03 10:50 |
Tokyo | Hosei University | An Improved Extended Result on Polynomial-Time Solvability of the Maximum Clique Problem Hiroaki Nakanishi, Etsuji Tomita, Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2012-28 |
This paper presents an improved extended result for polynomial-time solvability of the maximum clique problem, that is: ... [more] |
COMP2012-28 pp.17-24 |
| COMP | 2012-09-03 11:25 |
Tokyo | Hosei University | Compressing de Bruijn Graphs Alexander Bowe (NII), Taku Onodera (Univ. of Tokyo), Kunihiko Sadakane (NII), Tetsuo Shibuya (Univ. of Tokyo) COMP2012-29 |
We propose a new succinct de Bruijn graph representation. If the de Bruijn graph of $k$-mers in a DNA sequence of len... [more] |
COMP2012-29 pp.25-32 |
| COMP | 2012-09-03 13:30 |
Tokyo | Hosei University | [Invited Talk]
On a New Research Project "Exploring the Limits of Computation" Osamu Watanabe (Tokyo Tech) COMP2012-30 |
We explain the goal and the plan of a newly started project, Exploring the Limits of Compuation (ELC for short). This ... [more] |
COMP2012-30 p.33 |
| COMP | 2012-09-03 14:50 |
Tokyo | Hosei University | Partially Symmetric Functions are Efficiently Isomorphism-Testable Eric Blais (Carnegie Mellon Univ.), Amit Weinstein (Tel Aviv Univ.), Yuichi Yoshida (NII/Preferred Infrastructure) COMP2012-31 |
[more] | COMP2012-31 pp.35-40 |
| COMP | 2012-09-03 15:25 |
Tokyo | Hosei University | Faster Algorithms for Rectangular Matrix Multiplication Francois Le Gall (Univ. of Tokyo) COMP2012-32 |
Let $\alpha$ be the maximal value such that the product of an $n\times n^\alpha$ matrix by an $n^\alpha\times n$ matrix ... [more] | COMP2012-32 pp.41-48 |
| COMP | 2012-09-03 16:10 |
Tokyo | Hosei University | A New Direction for Counting Perfect Matchings Taisuke Izumi, Tadashi Wadayama (Nagoya Inst. of Tech.) COMP2012-33 |
We present a new exact algorithm for counting perfect matchings, which relies on neither inclusion-exclusion princip... [more] |
COMP2012-33 p.49 |
[Return to Top Page]