| 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:2008-06-16 to:2008-06-16'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2008-06-16 09:45 |
Ishikawa | JAIST | Online Uniformity of Integer Points on a Line Tetsuo Asano (JAIST)  COMP2008-15 |
[more] | COMP2008-15 pp.1-6 |
| COMP | 2008-06-16 10:10 |
Ishikawa | JAIST | Design and Analysis of Geometric Routing Algorithms Using Random Local Neighbors Kazushige Sato, Takeshi Tokuyama (Tohoku U.) COMP2008-16 |
We consider the geometric routing problem on mobile ad hoc wireless networks such that we can send packets by only usin... [more] |
COMP2008-16 pp.7-14 |
| COMP | 2008-06-16 11:00 |
Ishikawa | JAIST | A Context Tree Weighting Algorithm with an Adaptive Window Tomohiro I, Kohei Hatano, Hideo Bannai, Masayuki Takeda (Kyushu Univ.) COMP2008-17 |
The Context Tree Weighting Method (CTW) is one of the most effective algorithm in the area of universal data compression... [more] | COMP2008-17 pp.15-22 |
| COMP | 2008-06-16 11:35 |
Ishikawa | JAIST | Efficient XPath Tree Pattern Matching Algorithm over XML Data Stream Kazuhito Hagio, Takashi Ohgami, Masayuki Takeda (Kyushu Univ.) COMP2008-18 |
XPath is a language for specifying the selection of element nodes within XML documents. The essential part of XPath is ... [more] |
COMP2008-18 pp.23-30 |
| COMP | 2008-06-16 14:35 |
Ishikawa | JAIST | Constant-Working-Space Image Scan with a Given Angle Tetsuo Asano (JAIST) COMP2008-19 |
[more] | COMP2008-19 pp.31-36 |
| COMP | 2008-06-16 15:00 |
Ishikawa | JAIST | Simulation of a certain Voting Game Ryuhei Uehara (JAIST), Yasuyuki Kawamura (Ehime Univ.), Hiromitsu Matsunaga, Mitsuo Motoki (JAIST) COMP2008-20 |
[more] | COMP2008-20 pp.37-42 |
| COMP | 2008-06-16 15:35 |
Ishikawa | JAIST | Formulas for Counting Connected Spanning Subgraphs with at Most $n+1$ Edges in Graphs $K_{n}-e$, $K_{n}\cdot e$ Peng Cheng (Nagoya Gakuin Univ.), Shigeru Masuyama (Toyohashi Univ. of Tech) COMP2008-21 |
Let $N_{i}(G)$ denote the number of connected spanning $i$-edge subgraphs in an $n$-vertex $m$-edge undirected graph $... [more] |
COMP2008-21 pp.43-48 |
| COMP | 2008-06-16 16:10 |
Ishikawa | JAIST | Property Testing on k-Vertex-Connectivity of Graphs Yuichi Yoshida, Hiro Ito (Kyoto Univ.) COMP2008-22 |
We present an algorithm for testing $k$-vertex-connectivity of graphs with given maximum degree. The time complexity of ... [more] | COMP2008-22 pp.49-55 |
[Return to Top Page]