| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2007)
Search Results: Keywords 'from:2007-04-26 to:2007-04-26'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2007-04-26 10:00 |
Kyoto | Katsura Campus, Kyoto University | Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation Ryoso Hamane, Toshiya Itoh (Tokyo Inst. of Tech.)  COMP2007-1 |
[more] | COMP2007-1 pp.1-8 |
| COMP | 2007-04-26 10:35 |
Kyoto | Katsura Campus, Kyoto University | Read-error of probabilities for EAN barcodes Yukinori Taguchi, Nobuki Tokura (TUES) COMP2007-2 |
EAN code is one of barcodes widely used in retail sales, logistics and others. Barcodes are considerd very reliable but... [more] |
COMP2007-2 pp.9-16 |
| COMP | 2007-04-26 11:10 |
Kyoto | Katsura Campus, Kyoto University | Scheduling with Conflicts:Approximation Algorithm and Online Algorithms Guy Even (Tel Aviv Univ.), Magnus M. Halldorsson (Univ. Iceland), Lotem Kaplan, Dana Ron (Tel Aviv Univ.) COMP2007-3 |
[more] | COMP2007-3 pp.17-24 |
| COMP | 2007-04-26 13:15 |
Kyoto | Katsura Campus, Kyoto University | On Convex Optimization over Base Polytopes Kiyohito Nagano (Univ. of Tokyo) COMP2007-4 |
This note considers convex optimization problems over base polytopes of polymatroids. We show that the decomposition alg... [more] | COMP2007-4 pp.25-31 |
| COMP | 2007-04-26 13:50 |
Kyoto | Katsura Campus, Kyoto University | Degree reduction of lattice based attack for RSA Yoshinori Aono (Tokyo Tech) COMP2007-5 |
Boneh and Durfee proposed a method for attacking the RSA cryptography, which is based on LLL algorithm and which we c... [more] |
COMP2007-5 pp.33-40 |
| COMP | 2007-04-26 14:25 |
Kyoto | Katsura Campus, Kyoto University | Implementation of Probabilistic Timed Strong Simulation Algorithm Yuki Hasizume, Satoshi Yamane (Kanazawa Univ.) COMP2007-6 |
It is useful for real-time systems with probabilistic behaviors to verify formally probabilistic timed automata. Probabi... [more] | COMP2007-6 pp.41-48 |
| COMP | 2007-04-26 15:15 |
Kyoto | Katsura Campus, Kyoto University | Improving the LCA compression algorithm and its implementation Shirou Maruyama, Hiroshi Sakamoto (KIT) COMP2007-7 |
The grammar-based compression is a data compression method that finds the small size context free grammar for input text... [more] | COMP2007-7 pp.49-54 |
| COMP | 2007-04-26 15:50 |
Kyoto | Katsura Campus, Kyoto University | Repetitions in the infinite n-bonacci word Takahito Sasaki, Tsugutoyo Osaki, Akira Ishino, Ayumi Shinohara (Tohoku Univ.) COMP2007-8 |
The Fibonacci word $F_{m}$ is defined as the concatenation of the preceding two Fibonacci words $F_{m-1}$ and $F_{m-2}$.... [more] | COMP2007-8 pp.55-61 |
| COMP | 2007-04-26 16:25 |
Kyoto | Katsura Campus, Kyoto University | Suffix Array Based Computation of Substring Equivalence Classes Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2007-9 |
This paper considers enumerating substring equivalence classes introduced by Blumer et al. They used the equivalence cl... [more] |
COMP2007-9 pp.63-70 |
| COMP | 2007-04-26 17:00 |
Kyoto | Katsura Campus, Kyoto University | On an Efficient Off-Line Construction of Property Suffix Trees Takashi Uemura, Takuya Kida, Hiroki Arimura (Hokkaido Univ.) COMP2007-10 |
In some intelligent application of text retrieval, it is required to do a search just through particular parts of target... [more] | COMP2007-10 pp.71-78 |
[Return to Top Page]