| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2015)
Search Results: Keywords 'from:2015-06-12 to:2015-06-12'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2015-06-12 14:55 |
Hokkaido | [Invited Talk]
Recent Advances in Theory of Combinatorial Rigidity and Its Applications Naoki Katoh (KGU)  COMP2015-6 |
It is known that the condition m≧2n-3 is necessary for a 2-dimensional bar-joint framework with n pin-joints and and m b... [more] | COMP2015-6 p.27 |
|
| COMP, IPSJ-AL | 2015-06-12 16:05 |
Hokkaido | A 3+Omega(1) Lower Bound for Page Migration Akira Matsubayashi (Kanazawa Univ.) COMP2015-7 |
In this report, we prove that no deterministic online page migration algorithm is (3+o(1))-competitive, where o-notation... [more] | COMP2015-7 pp.29-36 |
|
| COMP, IPSJ-AL | 2015-06-12 17:15 |
Hokkaido | A design of real coded genetic algorithm processor Akihiko Tsukahara, Akinori Kanasugi (Tokyo Denki Univ.) COMP2015-8 |
In recent years, Real Coded Genetic Algorithm (RCGA) has been attracting attention. It is one of the GA for handling rea... [more] | COMP2015-8 pp.51-58 |
|
| COMP, IPSJ-AL | 2015-06-12 17:40 |
Hokkaido | An FPGA Implementation of Correlation Processor Yuma Matsui, Akihiko Tsukahara, Akinori Kanasugi, Ki Ando (Tokyo Denki Univ.) COMP2015-9 |
Correlation calculation is the operation for obtaining the similarity of two sets of data. This operation is frequently ... [more] | COMP2015-9 pp.59-65 |
|
| COMP, IPSJ-AL | 2015-06-13 08:30 |
Hokkaido | Fast Search Method for Moat Problems on Prime Elements in Imaginary Quadratic Fields Shinji Kinoshita, Hajime Matsui (TTI) COMP2015-10 |
The moat problems on prime elements in imaginary quadratic fields are unsolved problems that ``Can one walk to infinity ... [more] | COMP2015-10 pp.67-74 |
|
| COMP, IPSJ-AL | 2015-06-13 11:05 |
Hokkaido | An Algorithm for Uniform Deployment of Mobile agents in Asynchronous Rings Masahiro Shibata, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ.) COMP2015-11 |
In this paper, we consider the uniform deployment problem of mobile agents in asynchronous unidirectional ring networks... [more] |
COMP2015-11 pp.107-114 |
|
| COMP, IPSJ-AL | 2015-06-13 11:30 |
Hokkaido | On a Self-Stabilizing Algorithm for constructing a (1, 1)-Maximal Directed Acyclic Graph Using st-ordering Haruka Ono, Yoshiaki Katayama (NIT), Toshimitsu Masuzawa (OU) COMP2015-12 |
We propose a new network structure (s, t)-Maximal DAG and a self-stabilizing algorithm for constructing (1, 1)-Maximal D... [more] | COMP2015-12 pp.115-122 |
|
| COMP, IPSJ-AL | 2015-06-13 14:20 |
Hokkaido | On an Extension of Ukkonen's Online Suffix tree construction algorithm to Multi-Stream texts Takuya Takagi, Hiroki Arimura (Hokkaido Univ.) COMP2015-13 |
In this paper, we consider online construction of a text index for a set $S$ of $K$ strings in the dynamic setting that ... [more] |
COMP2015-13 pp.125-132 |
|
| COMP, IPSJ-AL | 2015-06-13 14:45 |
Hokkaido | Efficient Approximate Pattern Matching Algorithm for Trajectory Data Hirohito Sasakawa, Hiroki Arimura (Hokkaido Univ.) COMP2015-14 |
[more] | COMP2015-14 pp.133-139 |
|
| COMP, IPSJ-AL | 2015-06-13 15:10 |
Hokkaido | Double-array Representation with String Labels Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita, Jun-ichi Aoe (Tokushima Univ.) COMP2015-15 |
A trie is an ordered tree structure with a character on each edge. The trie provides an efficient management of a keywor... [more] | COMP2015-15 pp.141-148 |
|
[Return to Top Page]