Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IT, SIP, RCS |
2017-01-19 15:20 |
Osaka |
Osaka City Univ. |
A Study on Efficient Packet Demodulation of Frameless ALOHA Shun Ogata, Koji Ishibashi (The Univ. Electro-Commun.) IT2016-74 SIP2016-112 RCS2016-264 |
Generalized tree-structured expectation propagation (GTEP) decoder for low-density parity check codes over binary erasur... [more] |
IT2016-74 SIP2016-112 RCS2016-264 pp.165-170 |
COMP, ISEC |
2016-12-22 10:30 |
Hiroshima |
Hiroshima University |
[Invited Talk]
Theory and Practice of Succinct Data Structures Kunihiko Sadakane (Univ. of Tokyo) ISEC2016-82 COMP2016-43 |
Succinct data structures are data structures that can compress data to the limit and perform search and other operations... [more] |
ISEC2016-82 COMP2016-43 p.71 |
DC, SS |
2016-10-27 15:55 |
Shiga |
Hikone Kinro-Fukushi Kaikan Bldg. |
A Direct Update Method for XML Documents Including Data Values Compressed by Tree Grammars Ryunosuke Takayama, Kenji Hashimoto, Seki Hiroyuki (Nagoya Univ.) SS2016-27 DC2016-29 |
A tree grammar based compression is known as one of the compression methods for XML documents. Also, methods for updatin... [more] |
SS2016-27 DC2016-29 pp.55-60 |
NLC |
2016-09-09 10:00 |
Tokyo |
Convention Room AP Shibuya-Dogenzaka (Tokyo) |
Masahide Naemura, Miyazaki Masaru, Urakawa Makoto, Fujisawa Hiroshi (NHK) NLC2016-21 |
We are researching fusion of broadcasting and network communication that can utilizes TV program information to living s... [more] |
NLC2016-21 pp.51-56 |
SIS |
2016-03-11 10:10 |
Tokyo |
Tokyo City Univ. |
Impulse Noise Removal by Extended Median Filter Utilizing Minimum Spanning Tree with 8-neighborhood Saki Asamoto, Takanori Koga (NIT, Tokuyama College) SIS2015-63 |
In this study, we propose a random-valued impulse noise removal method with superior detail preservation capability by a... [more] |
SIS2015-63 pp.87-92 |
KBSE |
2016-03-03 11:10 |
Oita |
|
Matching source code using abstract syntax trees in version control Jonathan van den Berg, Hirohide Haga (Doshisha Univ.) KBSE2015-51 |
Managing software projects is based on several software development methodologies. One of those methodologies is softwar... [more] |
KBSE2015-51 pp.19-24 |
LOIS |
2016-03-03 14:40 |
Okinawa |
Central Community Center, Miyakojima-City |
An Extension of Update Method without Decompression for Compressed Structured Documents and Its Experimental Evaluation Takeshi Goto, Ryunosuke Takayama, Kenji Hashimoto, Hiroyuki Seki (Nagoya Univ.) LOIS2015-75 |
XML is a {it de facto} standard for data storage and exchange, and various compression methods for XML documents have be... [more] |
LOIS2015-75 pp.69-74 |
KBSE |
2016-01-25 16:00 |
Tokyo |
|
Code clone detecting method based on the degree of tree structure similarity Ryota Ami, Hirohide Haga (Doshisha Univ.) KBSE2015-43 |
In this article we propose to combine these two methods to improve the efficient and accuracy of detecting code clones. ... [more] |
KBSE2015-43 pp.19-24 |
VLD, CPSY, RECONF, IPSJ-SLDM, IPSJ-ARC [detail] |
2016-01-19 11:05 |
Kanagawa |
Hiyoshi Campus, Keio University |
FPGA routing structure based on H-Tree topology Yuki ishii, Masato Ikebe, Qian Zhao, Motoki Amagasaki, Masahiro Iida, Morihiro Kuga, Toshinori Sueyoshi (Kumamoto Univ.) VLD2015-78 CPSY2015-110 RECONF2015-60 |
FPGA(Fiele Programmable Gate Array) has many routing resources in order to provide the flexibility. These routing resour... [more] |
VLD2015-78 CPSY2015-110 RECONF2015-60 pp.7-12 |
RCS, IT, SIP |
2016-01-18 11:50 |
Osaka |
Kwansei Gakuin Univ. Osaka Umeda Campus |
Reduction of Decoding Iterations for Zigzag Decodable Fountain Codes Takayuki Nozaki (Yamaguchi Univ.) IT2015-52 SIP2015-66 RCS2015-284 |
Fountain codes are erasure correcting codes realizing the reliable communication for the multicast in the Internet. Zigz... [more] |
IT2015-52 SIP2015-66 RCS2015-284 pp.25-30 |
AI |
2015-12-18 14:30 |
Okinawa |
|
Comparison of SVM and Decision Tree for Prediction of Postoperative Hospital Stay Yuusuke Adachi, Takanori Yamashita, Yosifumi Wakata (Kyushu Univ.), Hidehisa Soejima (Saiseikai Kumamoto Hospital), Naoki Nakashima, Sachio Hirokawa (Kyushu Univ.) AI2015-36 |
In the medical practice, vast medical data are accumulated every day with medical computerization now. Due to increasin... [more] |
AI2015-36 pp.59-64 |
HCGSYMPO (2nd) |
2015-12-16 - 2015-12-18 |
Toyama |
Toyama International Conference Center |
Evaluation of body movement coordination between two dancers in street dance: A study based on a circular statistics method Ryoga Isozumi, Hikaru Sakamoto, Ryota Miyawaki, Kumiko Kokubo, Masashi Komori (OECU) |
Street-dance refers to an unstructured and highly improvisational dance style that has typically evolved outside formal ... [more] |
|
CCS |
2015-11-09 16:20 |
Kyoto |
Inamori Foundation Memorial Building, Kyoto Univ. |
Transition Process in Genealogical Network Tsuyoshi Mizuguchi, Narumi Ikuta (Osaka Pref. Univ.) CCS2015-55 |
Genealogical trees of sexually reproducing organism generally form a complex network structure. It can be regarded as a ... [more] |
CCS2015-55 pp.57-60 |
NLC |
2015-09-11 11:35 |
Tokyo |
Convention Room AP Shibuya-Dogenzaka (Tokyo) |
Feature Words to Predict Long Post-Operatively Stay in Semi-structured Medical Records Takanori Yamashita, Haruka Kubo, Yuusuke Adachi, Yoshifumi Wakata, Brendan Flanagan (Kyushu Univ.), Hidehisa Soejima (Kumamoto Hospital), Naoki Nakashima, Sachio Hirokawa (Kyushu Univ.) NLC2015-32 |
The hospital information system has expanded, and importance of medical data utilization is increasing. Electronic medic... [more] |
NLC2015-32 pp.75-79 |
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 |
KBSE |
2015-05-25 16:10 |
Tokyo |
|
Tree structural expression of program based on program slicing Katsuhisa Yoneda, Hirohide Haga (Doshisha Univ.) KBSE2015-6 |
This article proposes a tree structure expression of programs for algorithmic debugging using program slicing.
Program ... [more] |
KBSE2015-6 pp.27-32 |
IA, IPSJ-IOT, SITE [detail] |
2015-03-06 14:20 |
Fukushima |
|
Fast Searchable Encryption Scheme Using Single Bloom Filter and Its Evalustion Shunsuke Kimura, Hiroyuki Inaba (KIT) SITE2014-79 IA2014-111 |
Recently, cloud storage service which store several documents on the Internet has become widespread.
This has the remar... [more] |
SITE2014-79 IA2014-111 pp.227-232 |
KBSE |
2015-03-05 15:55 |
Tokyo |
The University of Electro-Communications |
A study of reading comprehension improvement technique of safety case with modules Junpei Kondo, Shuji Morisaki, Shuichiro Yamamoto (Nagoya Univ.) KBSE2014-58 |
Safety case is used to indicate that the system satisfies the safety. However, there are problems such as difficulty to ... [more] |
KBSE2014-58 pp.37-42 |
RECONF, CPSY, VLD, IPSJ-SLDM [detail] |
2015-01-30 10:30 |
Kanagawa |
Hiyoshi Campus, Keio University |
Error detection using residue signed-digit number arithmetic for arithmetic circuits Yoshitomo Nema, Yuuki Tanaka, Kazuhiro Motegi, Shugang Wei (Gunma Univ) VLD2014-136 CPSY2014-145 RECONF2014-69 |
For error detection of multiply-accumulate operation, a residue error detector can be considered for the VLSI implementa... [more] |
VLD2014-136 CPSY2014-145 RECONF2014-69 pp.151-156 |
IA |
2014-11-06 15:50 |
Overseas |
Thailand |
Isan Dhamma Character Recognition on Palm Leaves based on Logistic Model Tree Preecha Khakham, Narumol Chumuang, Mahasak Ketcham (King Mongkut Univ. of Tech.) IA2014-55 |
This paper proposes a new approach for Isan Dhamma handwriting on palm leaves character recognition system based on Logi... [more] |
IA2014-55 pp.109-114 |