| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| CPSY | 2017-11-19 15:00 |
Aomori | Aomori Tourist Information Center, ASPAM | [Poster Presentation]
GPU Applications with Single Kernel Synchronization Technique Shunji Funasaka, Koji Nakano, Yasuaki Ito (Hiroshima Univ.)  CPSY2017-56 |
A task array is a 2-dimensional array of tasks with dependency relations. Conventional CUDA implementations repeatedly ... [more] |
CPSY2017-56 pp.33-38 |
| ITS, IPSJ-ITS, IEE-ITS | 2017-09-04 13:50 |
Toyama | Toyama Institute of Information Systems | A Fast Map-matching algorithm based on Global Optimization
-- Dynamic Programming and a fast link connectivity verification -- Tatsuya Hamaoka (Fujitsu Ten), Masato Mizu, Takayoshi Yokota (Tottori Univ.) ITS2017-8 |
The location data from positioning devices, such as GPS, provides vital information for the probe car systems aiming at... [more] | ITS2017-8 pp.17-22 |
| SWIM, SC | 2017-08-25 11:10 |
Tokyo | Dynamic Programming Method for Retrieving Similar Numerical Sequences
-- Application to Mining Stock Price Sequences -- Yoshihisa Udagawa (Tokyo Polytechnic Univ.) SWIM2017-9 SC2017-14 |
The trend of stock price fluctuation continues with intermission of several days because stock prices tend to fluctuate ... [more] | SWIM2017-9 SC2017-14 pp.7-12 |
|
| COMP | 2017-08-18 14:50 |
Aomori | A dynamic programming based algorithm for enumerating unlabeled unrooted trees Ryuji Masui, Aleksandar Shurbevski, Hiroshi Nagamochi (Kyoto Univ.) COMP2017-17 |
We propose a dynamic programming based algorithm for the enumeration of unlabeled and unrooted trees on $n$ vertices. Th... [more] | COMP2017-17 pp.33-40 |
|
| EMM, IT | 2017-05-23 14:25 |
Yamagata | Yamagata University(Yonezawa Campus) | A Dynamic Programming Algorithm to Construct Optimal Code Trees of Binary AIFV-m Codes Takaya Kawai, Ken-ichi Iwata (Univ. of Fukui), Hirosuke Yamamoto (The Univ. of Tokyo) IT2017-14 EMM2017-14 |
Yamamoto, Tsuchihashi, and Honda proposed binary almost instantaneous fixed-to-variable length (AIFV) codes, which allow... [more] | IT2017-14 EMM2017-14 pp.79-84 |
| IBISML | 2016-11-17 14:00 |
Kyoto | Kyoto Univ. | [Poster Presentation]
Estimating Proton Conductivity in Crystals by using Guassian Process and Dynamic Programming Kenta Kanamori (NITech), Kazuaki Toyoura (Kyoto Univ.), Shinichi Nakajima (TU Berlin), Atsuto Seko (Kyoto Univ.), Masayuki Karasuyama (NITech), Akihide Kuwabara (JFCC), Junya Honda (Tokyo Univ.), Kazuki Shitara (JFCC), Motoki Shiga (Gifu Univ.), Ichiro Takeuchi (NITech) IBISML2016-73 |
In material science, $proton conductivity$ is very important property for designing new battery and it is defined as max... [more] | IBISML2016-73 pp.191-198 |
| SIS | 2016-06-09 11:20 |
Hokkaido | Kushiro Tourism and Convention cent. | A Note on Teaching Strategies Using Markov Decision Processes Yasunari Maeda, Masakiyo Suzuki (KIT) SIS2016-2 |
In this research Markov decision processes(MDP) with unknown states are used in order to represent lectures. Effectivene... [more] | SIS2016-2 pp.7-10 |
| COMP | 2016-03-14 13:30 |
Fukuoka | Longest Common Subsequence Problem for Numerical Sequences by using Order-Isomorphic-Substrings Masatoshi Kurihara, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2015-38 |
The order-isomorphism can be used as a criteria for the similarity of numerical sequences. The order-preserving matching... [more] | COMP2015-38 pp.11-20 |
|
| COMP | 2015-12-01 10:30 |
Osaka | A Fast Method for Solving Constrained Shortest Path Problems on Directed Acyclic Graphs Fumito Takeuchi (Hokkaido Univ.), Masaaki Nishino (NTT), Norihito Yasuda (Hokkaido Univ.), Takuya Akiba (NII), Shin-ichi Minato (Hokkaido Univ.), Masaaki Nagata (NTT) COMP2015-31 |
This paper deals with shortest path problems on directed acyclic graphs (DAGs), under logical constraints posed between... [more] | COMP2015-31 pp.9-16 |
|
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2015-12-02 16:45 |
Nagasaki | Nagasaki Kinro Fukushi Kaikan | Layout Decomposition into L-Shaped Parts for Variable Shaped-Beam Mask Writer Katsuya Hoshi, Kunihiro Fujiyoshi (TUAT) VLD2015-52 DC2015-48 |
Since electron beam mask writers for LSI mask fabrication can only expose a rectangle shaped-beam, a layout pattern has ... [more] | VLD2015-52 DC2015-48 pp.87-92 |
| IA | 2015-10-19 16:40 |
Tokyo | Takeda Hall, Takeda Bldg. 5F, Hongo Campus, Univ. of Tokyo | Efficient Network Policy Checking with Multi-dimensional Graph Traversal Algorithm Chen Richard, Takeru Inoue, Toru Mano, Kimihiro Mizutani, Hisashi Nagata, Osamu Akashi (NTT) IA2015-34 |
Since network operators find much difficulty in guaranteeing to correctly configure their complex networks, they are st... [more] |
IA2015-34 pp.25-30 |
| NLP, CAS | 2015-10-06 09:30 |
Hiroshima | Aster Plaza | Polygon Fracture Method Considering Maximum Shot Size for Variable Shaped-Beam Mask Writing Mitsuru Hasegawa, Kunihiro Fujiyoshi (TUAT) CAS2015-34 NLP2015-95 |
Since variable shaped-beam mask writing machines for LSI mask production can expose a rectangle shaped-beam, we need to ... [more] | CAS2015-34 NLP2015-95 pp.69-74 |
| IN, NV (Joint) |
2015-07-17 11:15 |
Hokkaido | Hokkaido University | [Invited Talk]
Exploiting ZDDs on Constrained Dynamic Programming Problems Norihito Yasuda (Hokkaido Univ.) IN2015-34 |
Dynamic Programming is a fundamental tool for many optimization problems. However, in practical situations, in addition ... [more] | IN2015-34 pp.67-72 |
| PRMU, MI, IE, SIP | 2015-05-15 10:30 |
Mie | * Masayuki Noguchi (Kyushu Univ.), Rika Motodate, Toshiharu Suzuki (Hokkaido Univ.), Seiichi Uchida (Kyushu Univ.) SIP2015-16 IE2015-16 PRMU2015-16 MI2015-16 |
(To be available after the conference date) [more] | SIP2015-16 IE2015-16 PRMU2015-16 MI2015-16 pp.83-88 |
|
| PRMU, CNR | 2015-02-19 15:10 |
Miyagi | * Ryo Yamaguchi, Taiga Fukasawa (Kyushu Univ.), Eiji Watanabe (NIBB), Seiichi Uchida (Kyushu Univ.) PRMU2014-125 CNR2014-40 |
(To be available after the conference date) [more] | PRMU2014-125 CNR2014-40 pp.75-80 |
|
| COMP | 2014-10-08 15:15 |
Tokyo | Chuo University | Fast Indexing All Eulerian Trails Using Permutation Decision Diagrams Yuma Inoue, Shin-ichi Minato (Hokkaido Univ.) COMP2014-30 |
An Eulerian trail is a trail containing all edges of a given graph exactly once. Although counting problem of Eulerian ... [more] |
COMP2014-30 pp.25-29 |
| MSS | 2014-03-06 13:30 |
Ehime | Ehime Univ. | Risk-sensitive optimal supervisory control of discrete event systems Tatsushi Yamasaki, Taishi Irie, Shin Matsubara (Setsunan Univ.) MSS2013-75 |
In the optimal supervisory control of discrete event systems, the worst case cost and the expectation cost are mainly us... [more] | MSS2013-75 pp.1-6 |
| PRMU, IPSJ-CVIM, MVE [detail] | 2014-01-24 09:10 |
Osaka | Spotting recognition of performance motions of figure skating from videos of TV broadcasting Yuki Yokokura, Syunpei Torii, Yuki Nitsuma, Yuichi Yaguchi, Ryuichi Oka (Univ. of Aizu) PRMU2013-106 MVE2013-47 |
We report the result of spotting recognition of sport motions captured by moving cameras of broadcasting TV. We focused ... [more] | PRMU2013-106 MVE2013-47 pp.159-164 |
|
| COMP | 2013-10-18 16:25 |
Aichi | Nagoya Institute of Technology | An Algorithm for the coin-exchange problem of Frobenius using a parse table Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2013-37 |
The coin-exchange problem of Frobenius is a problem that finds the Frobenius number for relatively prime positive intege... [more] | COMP2013-37 pp.25-28 |
| PRMU, MI, IE | 2013-05-24 15:30 |
Aichi | Myocardial motion by bi-directional DP-tracking for echocardiography Kazuhisa Murakami, Wataru Ohyama, Tetsushi Wakabayashi, Fumitaka Kimura (Mie Univ.), Kiyotsugu Sekioka (Sekioka Clinic) IE2013-16 PRMU2013-9 MI2013-9 |
The echocardiogram is an essential tool for diagnosis and treatment of cardiovascular diseases. The use of echocardiogra... [more] | IE2013-16 PRMU2013-9 MI2013-9 pp.45-50 |
|
[Return to Top Page]