| 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 # | |
| 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 |
| MoNA, ASN, IPSJ-MBL, IPSJ-UBI (Joint) [detail] |
2015-03-02 11:00 |
Tokyo | Shibaura Institute of Technology(Toyosu Campus) | Cloud-based ECG Monitoring System for Mobile Users Mohamad Sabri Bin Sinal, Eiji Kamioka (SIT) MoNA2014-94 |
Nowadays, new wireless technologies have been well-established and high capabilities of wearable biomedical sensor devic... [more] | MoNA2014-94 pp.43-48 |
| PRMU | 2014-12-12 15:45 |
Fukuoka | A study on speedup of the graph cut PushRelabel processing using GPU Dynamic Parallelism Rei Kasedo, Kiyoshi Oguri, Yuichiro Shibata (Nagasaki Univ) PRMU2014-85 |
We have implemented a PushRelabel algorithm using a NVIDIA and CUDA. In late years the CUDA which is a GPU developping... [more] |
PRMU2014-85 pp.117-121 |
|
| 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 |
| CAS, SIP, MSS, VLD, SIS [detail] | 2014-07-09 13:40 |
Hokkaido | Hokkaido University | Weighted Dominating Sets and Induced Matchings in Orthogonal Ray Graphs Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2014-10 VLD2014-19 SIP2014-31 MSS2014-10 SIS2014-10 |
An orthogonal ray graph is an intersection graph of horizontal rays (closed half-lines) and vertical rays in the plane. ... [more] | CAS2014-10 VLD2014-19 SIP2014-31 MSS2014-10 SIS2014-10 pp.45-48 |
| MI | 2014-06-24 09:00 |
Fukuoka | Lecture Hall, Building B of Basic Sciences, Kyushu University | 3D Model Generation of Brain Block Using Internal Structure Contours for 3D Japanese Brain Atlas Construction Shou Sasaki, Ken'ichi Morooka, Kaoru Kobayashi, Tokuo Tsuji (Kyushu Univ.), Yasushi Miyagi (Kaizuka Hospital), Takaichi Fukuda (Kumamoto Univ.), Kazuhiro Samura (Fukuoka Univ.), Ryo Kurazume (Kyushu Univ.) MI2014-22 |
The digital human modeling is one of the challenging topics in the last few decades. We have been studying on the digita... [more] | MI2014-22 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-12-20 13:45 |
Okinawa | Okinawa Industry Support Center | A Power Allocation Management System Using an Algorithm for the Knapsack Problem Naoyuki Morimoto, Yuu Fujita, Masaaki Yoshida, Hiroyuki Yoshimizu, Masafumi Takiyamada, Terukazu Akehi, Masami Tanaka (Enegate) COMP2013-44 |
Power management for saving energy and reducing peak load can be viewed as the knapsack problem as follows; an appliance... [more] | COMP2013-44 pp.39-43 |
| 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 |
| IN | 2013-06-20 14:25 |
Fukui | University of Fukui, Bunkyo Campus, Memorial Academy Hall | Writing Window Join Processor in C Eric Shun Fukuda (Hokkaido Univ.), Hideyuki Kawashima (Univ. of Tsukuba), Hiroaki Inoue (NEC), Tetsuya Asai, Masato Motomura (Hokkaido Univ.) IN2013-26 |
In the past, there has always been a wide gap between the skills for designing software and hardware. Now that reconfigu... [more] | IN2013-26 pp.7-12 |
| 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 |
|
| COMP, IPSJ-AL | 2013-05-17 15:05 |
Hokkaido | Otaru University of Commerce | Efficient Enumeration of Directed Binary Perfect Phylogenies using Dynamic Programming Kazuki Morito (SEIBU CONSTRUCTION), Toshiki Saitoh, Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) COMP2013-12 |
We consider an enumeration of directed binary perfect phylogenies from incomplete data. Recently, Kiyomi et al. proposed... [more] | COMP2013-12 pp.63-70 |
| COMP | 2013-03-18 15:15 |
Gifu | Gifu University | A New Exact Algorithm for the Maximum Weight Clique Problem Based on an Upper Bound Calculated by Dynamic Programming Satoshi Shimizu, Kazuaki Yamaguchi, Toshiki Saitoh, Sumio Masuda (Kobe Univ.) COMP2012-59 |
Given a vertex-weighted undirected graph, the problem to find the clique of maximum weight is the maximum weight clique ... [more] | COMP2012-59 pp.47-53 |
| PRMU | 2013-02-22 14:30 |
Osaka | Sequence Number-free Detection of Similar Sequences Among Multiple Sequences
-- Proposal of Circle Continuous Dynamic Programming -- Ryuichi Oka (Aizu Univ.) PRMU2012-172 |
We propose a method called Circle Continuous Dynamic Programming (CCDP) for sequence number-free detection of similar se... [more] | PRMU2012-172 pp.197-202 |
|
| MI | 2013-01-25 09:15 |
Okinawa | Bunka Tenbusu Kan | Anatomical landmark-based local deformation method for medical registration Keiko Morita, Atsushi Imiya (Chiba Univ.), Tomoya Sakai (Nagasaki Univ.), Yoshitaka Masutani (Dept. of Radiology, The Univ. of Tokyo Hospital), Hidekata Hontani (Naitech) MI2012-93 |
In this paper, we develop a method for constructing the mean boundary curve of anatomical objects by using anatomical la... [more] | MI2012-93 pp.161-166 |
[Return to Top Page]