| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2011)
Search Results: Keywords 'from:2011-04-22 to:2011-04-22'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2011-04-22 09:30 |
Kyoto | Kyoto University | A construction method for non-left-recursive parsing expression grammars Shunichi Matsubara, Shojiro Ogawa, Marin J. Duerst (Aoyama Gakuin Univ.)  COMP2011-1 |
Parsing expression grammars (PEGs) have recently been used to describe the syntax of artificial languages such as progra... [more] | COMP2011-1 pp.1-8 |
| COMP | 2011-04-22 10:05 |
Kyoto | Kyoto University | Stochastic Node Departure Process and Alive-Node Connection for P2P Systems Susumu Shibusawa, Mamoru Kobayashi, Hiroshi Ohno, Tatsuhiro Yonekura (Ibaraki Univ.) COMP2011-2 |
Node departure from P2P system affects the maintenance of system, and managing the effect of node departure is very impo... [more] | COMP2011-2 pp.9-16 |
| COMP | 2011-04-22 10:50 |
Kyoto | Kyoto University | Construction of a SeqBDD representing a set of reversed sequences Hiroshi Aoki, Shigeru Yamashita (Ritsumeikan Univ.), Shin-ichi Minato (Hokkaido Univ.) COMP2011-3 |
A trie is a data structure representing a set of sequences by sharing the same prefixes between sequences. Thanks to thi... [more] | COMP2011-3 pp.17-23 |
| COMP | 2011-04-22 11:25 |
Kyoto | Kyoto University | $\pi$DDs(PiDDs): Binary Decision Diagrams for Manipulating Sets of Combinations Shin-ichi Minato (Hokkaido Univ.) COMP2011-4 |
Permutations and combinations are a couple of basic concepts in elementary combinatorics. Permutations appear in various... [more] | COMP2011-4 pp.25-32 |
| COMP | 2011-04-22 13:20 |
Kyoto | Kyoto University | Approximation algorithms for the source location problem with local vertex-connectivity demands Takuro Fukunaga (Kyoto Univ.) COMP2011-5 |
The source location problem is a problem of computing a minimum cost source set in an undirected graph so that the conne... [more] | COMP2011-5 pp.33-39 |
| COMP | 2011-04-22 13:55 |
Kyoto | Kyoto University | A further improved result on polynomial-time solvability of the maximum clique problem Hiroaki Nakanishi (UEC), Etsuji Tomita (UEC/Chuo Univ.), Mitsuo Wakatsuki, Tetsuro Nishino (UEC) COMP2011-6 |
This report presents a further improved result for polynomial-time solvability of the maximum clique problem, that is: f... [more] | COMP2011-6 pp.41-48 |
| COMP | 2011-04-22 14:30 |
Kyoto | Kyoto University | Reconstructing sets from distances given by graphs Meng Li, Yota Otachi, Takeshi Tokuyama (Tohoku Univ.) COMP2011-7 |
Given $n$ points in some Euclidean space, $\binom{n}{2}$ pairwise distances among the points can be easily calculated. ... [more] |
COMP2011-7 pp.49-54 |
| COMP | 2011-04-22 15:15 |
Kyoto | Kyoto University | Computation of quantifier elimination of linear inequlities of first order predicate logic Yuuki Ono, Satoshi Yamane (Kanazawa Univ.) COMP2011-8 |
In this paper, the algorhithm of quantifier elimination of first-order predicate logic for linear inequalities will be d... [more] | COMP2011-8 pp.55-59 |
| COMP | 2011-04-22 15:50 |
Kyoto | Kyoto University | Online Prediction on Labeled Graphs Koji Kobayashi, Kunihiko Sadakane (NII) COMP2011-9 |
[more] | COMP2011-9 pp.61-68 |
| COMP | 2011-04-22 16:35 |
Kyoto | Kyoto University | An Optimal Bound for the 2-Frame Throughput Maximization Problem Koji Kobayashi (NII), Jun Kawahara (JST) COMP2011-10 |
[more] | COMP2011-10 pp.69-76 |
| COMP | 2011-04-22 17:10 |
Kyoto | Kyoto University | An Online Algorithm Optimally Self-tuning to Congestion for Power Managementt Problems Wolfgang W. Bein (Univ. of Nevada), Naoki Hatta, Hiro Ito (Kyoto Univ.), Jun Kawahara (JST) COMP2011-11 |
[more] | COMP2011-11 pp.77-82 |
[Return to Top Page]