| 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 # | |
| R | 2019-11-28 13:45 |
Osaka | Central Electric Club | A Note on Moment-Based Approximation for Uncertainty Propagation in Hierarchical Models Jiahao Zhang (Hiroshima Univ.), Junjun Zheng (Ritsumeikan Univ.), Hiroyuki Okamura, Tadashi Dohi (Hiroshima Univ.)  R2019-43 |
This paper discusses an approximation method for uncertainty propagation in a hierarchical model. The uncertainty propag... [more] | R2019-43 pp.1-6 |
| NS | 2019-10-10 16:10 |
Aichi | Nagoya Institute of Technology | [Invited Talk]
On recent developments in network reliability computation using binary decision diagrams Jun Kawahara (Kyoto Univ.) NS2019-113 |
Given a network with static link failure probabilities, the network reliability is to compute the probability that two s... [more] | NS2019-113 pp.59-62 |
| NC, IBISML, IPSJ-MPS, IPSJ-BIO [detail] | 2019-06-17 13:00 |
Okinawa | Okinawa Institute of Science and Technology | Analysis and application of periodic orbits in dynamic binary neural networks Shota Anzai, Seitaro Koyama, Toshimichi Saito (HU) NC2019-1 |
This paper studies a simple dynamic binary neural network and its application. In the network, each neuron transforms ... [more] |
NC2019-1 p.1 |
| VLD | 2017-03-03 11:20 |
Okinawa | Okinawa Seinen Kaikan | Optimization of Parallel Prefix Adder Using Simulated Annealing Takayuki Moto, Mineo Kaneko (JAIST) VLD2016-127 |
In this report, simulated annealing based optimization of parallel prefix adders (PPA) is proposed. In order to construc... [more] | VLD2016-127 pp.139-144 |
| ICM | 2016-07-07 15:05 |
Hokkaido | Multiple Isolating Actions Extraction from Action Logs for Clarifying Trouble-shooting Process Akio Watanabe, Yoichi Matsuo, Keishiro Watanabe, Keisuke Ishibashi, Ryoichi Kawahara (NTT) ICM2016-13 |
Virtualization of ICT system has made more convenient of its use. However, complicated system architecture by virtualiz... [more] |
ICM2016-13 pp.27-32 |
|
| WBS, SAT (Joint) |
2015-05-29 10:05 |
Tokyo | Tokyo City Univ. (Setagaya Campus) | Error Probability Analysis for Data fusion of End-Nodes in Tree Networks Longfei Zhou, Ikuo Oka, Shingo Ata (Osaka City Univ.) SAT2015-7 |
In the preceding works on the tree networks composed of binary symmetric channel (BSC), the error probability of majorit... [more] | SAT2015-7 pp.37-41 |
| 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 |
|
| 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 |
| DC | 2014-10-27 16:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | An Autonomous Tree-Structured Group ID Reassignment Method for Mobile Ad Hoc Networks Hiroaki Yagi, Eitaro Kohno, Yoshiaki Kakuda (Hiroshima City Univ.) DC2014-24 |
In mobile ad hoc networks (MANETs), a link between nodes can be disrupted by both the instability of wireless communicat... [more] | DC2014-24 pp.17-22 |
| ICSS, ISEC, SITE, EMM, IPSJ-CSEC, IPSJ-SPT [detail] | 2014-07-04 13:50 |
Hokkaido | San-Refure Hakodate | Proposal on Fast Searchable Encryption Scheme Using Bloom Filter Shunsuke Kimura, Hiroyuki Inaba (Kyoto Inst. of Tech.) ISEC2014-40 SITE2014-35 ICSS2014-44 EMM2014-40 |
Recently, cloud storage service which store several documents on the Internet has become widespread. This has the remar... [more] |
ISEC2014-40 SITE2014-35 ICSS2014-44 EMM2014-40 pp.281-286 |
| HIP | 2014-03-19 15:00 |
Tokyo | Tokyo Univ. | Real-Time Deformation Simulation of Non-Linear Elastic Objects Using Online Re-Mesh Co-Rotated Deformation Model Kazuyoshi Tagawa, Takahiro Yamada, Hiromi T. Tanaka (Ritsumeikan Univ.) HIP2013-101 |
In surgery simulations, a computationally efficient deformation simulation approach which can consider the geometric non... [more] | HIP2013-101 pp.117-122 |
| NS, IN (Joint) |
2014-03-06 10:10 |
Miyazaki | Miyazaki Seagia | Counting pedestrians on bi-directional walkway using binary sensor array Shuto Fujii, Yoshiaki Taniguchi, Go Hasegawa, Morito Matsuoka (Osaka Univ.) NS2013-188 |
In this report, we propose a method for estimating the number of pedestrians walking in opposite directions, as in cases... [more] | NS2013-188 pp.67-72 |
| ISEC, LOIS | 2013-11-28 15:25 |
Miyagi | Tohoku Univ. | Efficient Multi-Party Private Set Intersection Protocol Tomoaki Mimoto, Atsuko Miyaji (JAIST) ISEC2013-63 LOIS2013-29 |
Private Set Intersection Protocol(PSI) is a protocol by which two or more players with each data sets can compute some i... [more] | ISEC2013-63 LOIS2013-29 pp.29-34 |
| QIT (2nd) |
2013-11-18 11:20 |
Tokyo | Waseda Univ. | A Representation of Quantum Graph States Using Binary Decision Diagrams Yuto Hirakuri, Hidefumi Hiraishi, Hiroshi Imai (Univ. of Tokyo) |
We discuss an efficient classical simulation of measurement-based quantum computation (MQC), focusing on relationships b... [more] | |
| IT | 2012-05-25 14:00 |
Fukuoka | A consideration on characteristics of Huffman codes for binary memoryless sources Takahiro Yoshida, Hajime Jinushi (Aoyama Gakuin Univ.) IT2012-1 |
We consider characteristics of Huffman codes for extended binary memoryless sources. The construction of Huffman codes c... [more] | IT2012-1 pp.1-6 |
|
| VLD, CPSY, RECONF, IPSJ-SLDM [detail] | 2012-01-26 11:15 |
Kanagawa | Hiyoshi Campus, Keio University | Error Checker using Binary tree structure of Residue Signed-Digit Additions Qian Liu, Kazuhiro Motegi, Shugang Wei (Gunma Univ.) VLD2011-111 CPSY2011-74 RECONF2011-70 |
In this paper, a fast residue checker for error detection of arithmetic circuits is presented. The residue checker consi... [more] | VLD2011-111 CPSY2011-74 RECONF2011-70 pp.117-121 |
| ITE-ME, ITE-AIT, IE [detail] | 2011-11-11 11:40 |
Fukuoka | Smart Dictionary for Learning-Based Super-Resolution Akinobu Hashimoto, Tomohiro Nakaya, Nobutaka Kuroki, Tetsuya Hirose, Masahiro Numa (Kobe Univ.) IE2011-83 |
In this paper, a novel dictionary construction technique for example based super-resolution is proposed. Conventional te... [more] | IE2011-83 pp.35-40 |
|
| IBISML | 2011-06-20 17:15 |
Tokyo | Takeda Hall | Fast Similarity Search of Binary Codes with Wavelet Tree Yasuo Tabei (JST), Koji Tsuda (CBRC) IBISML2011-15 |
Similarity search using locality sensitive codes is recently of increasing interest due to unprecedented scalability. Un... [more] | IBISML2011-15 pp.103-110 |
| COMP | 2011-03-09 13:00 |
Tokyo | Chuo Univ. | New k shortest simple path algorithm that reduces the average case time complexity Hiroshi Matsuura (NTT) COMP2010-49 |
The author proposed k-SPF-plus algorithm that realizes to shorten the worst case time complexity for creating k shortest... [more] | COMP2010-49 pp.17-24 |
| IN | 2010-12-17 10:25 |
Hiroshima | Hiroshima City Univ. | A proposal of k shortest simple path algorithm to minimize computational complexity Hiroshi Matsuura (NTT) IN2010-107 |
k shortest path algorithm is expected to be applied to creating replacement paths and traffic dispersion by using multip... [more] | IN2010-107 pp.57-62 |
[Return to Top Page]