| 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 # | |
| ITS, IEE-ITS | 2022-03-11 10:25 |
Online | Online | Judgement of Start using On-Vehicle 3D-LiDAR for Autonomous Vehicle at Temporary Stop of Intersection Yuki Komatsu (AIST/Tokyo Univ. of Science), Shin Kato (AIST), Makoto Itami (Tokyo Univ. of Science)  ITS2021-65 |
In this paper, we proposed a system for detecting moving objects at intersections and judge whether the vehicle start us... [more] | ITS2021-65 pp.13-18 |
| ICTSSL, CAS | 2020-01-30 17:20 |
Tokyo | On approximate solutions to unsplittable flow edge load factor balancing problem Fumiya Onogi, Hikaru Kasuga, Norihiko Shinomiya (Soka Univ.) CAS2019-78 ICTSSL2019-47 |
This paper discusses a method for leveling traffic load of communication links in a distributed management network with ... [more] | CAS2019-78 ICTSSL2019-47 pp.77-80 |
|
| RCS | 2019-06-20 11:30 |
Okinawa | Miyakojima Hirara Port Terminal Building | User Allocation with Round-Robin Scheduling Sequence for Distributed Antenna System Go Otsuru, Yukitoshi Sanada (Keio Univ.) RCS2019-74 |
One of key technologies in the fifth generation mobile communications is a distributed antenna system (DAS). In the DAS ... [more] | RCS2019-74 pp.227-232 |
| RCS | 2019-04-19 09:30 |
Hokkaido | Noboribetsu Grand Hotel | A Study on Low Complexity Fair User Scheduling Employing Spatial Orthogonality for MU-MIMO Systems Ei Nandar Maung, Yukiko Shimbo, Hirofumi Suganuma, Fumiaki Maehara (Waseda Univ.) RCS2019-13 |
This report proposes a low complexity fair user scheduling method employing semiorthogonal user selection (SUS) for mult... [more] | RCS2019-13 pp.55-59 |
| SIP, EA, SP, MI (Joint) [detail] |
2018-03-20 09:00 |
Okinawa | [Poster Presentation]
Consideration on Fingertip Gesture Input System for Wearable Devices with Head Movements Ayaka Mineo, Tomoki Tanaka, Yoshihiro Yamashita, Takao Nishitani, Kiyoshi Nishikawa (Tokyo Metropolitan Univ.) EA2017-154 SIP2017-163 SP2017-137 |
We consider a detection method which is robust against head shake for gesture input systems with wearable terminals equi... [more] | EA2017-154 SIP2017-163 SP2017-137 pp.287-290 |
|
| CAS, MSS, VLD, SIP | 2010-06-21 16:10 |
Hokkaido | Kitami Institute of Technology | Reversible Component Transforms via an Interpretation of the LU Factorization Hisakazu Kikuchi, Junghyeun Hwang, Shogo Muramatsu (Niigata Univ.) CAS2010-15 VLD2010-25 SIP2010-36 CST2010-15 |
A variant to a given irreversible linear transformation is defined based on the LU decomposition of a nonsingular matrix... [more] | CAS2010-15 VLD2010-25 SIP2010-36 CST2010-15 pp.81-86 |
| SIP, ICD, IE, IPSJ-SLDM (Joint) [detail] |
2007-10-25 16:20 |
Fukushima | Aidu-Higasiyama-Onsen Kuturogijuku | Foreground Segmentation Using Spatio-Temporal Processing
-- A Study on TOPS DSP Architecture Driven Algorithm for Foreground Segmentation -- Hiroaki Tezuka, Tomoyuki Suzuki, Takao Nishitani (Tokyo Metropolitan Univ.) SIP2007-120 ICD2007-109 IE2007-79 |
This paper describes a robust foreground segmentation algorithm in HDTV video sequence. The present algorithm is based ... [more] |
SIP2007-120 ICD2007-109 IE2007-79 pp.59-64 |
| ISEC, SITE, IPSJ-CSEC | 2006-07-21 10:45 |
Okayama | Okayama Univ. | Asymptotic Lower Bound on Round Complexity of Bounded Concurrent Black-Box Zero-Knowledge Proof Protocols Hirofumi Muratani (Toshiba) |
We derive a lower bound on the round complexity of an $m$-bounded concurrent black-box zero-knowledge interactive proof ... [more] | ISEC2006-43 pp.19-26 |
| ISEC, SITE, IPSJ-CSEC | 2006-07-21 14:15 |
Okayama | Okayama Univ. | Password-Authenticated Key Exchange for Multi-Party with Different Passwords Using a Constant Number of Rounds Jeong Ok Kwon (Korea Univ./Kyushu Univ.), Kouichi Sakurai (Kyushu Univ.), Dong Hoon Lee (Korea Univ.) |
Password-authenticated key exchange (PAKE) for multi-party with different passwords allows group users with different p... [more] |
ISEC2006-55 pp.115-122 |
| ISEC | 2006-05-19 16:10 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | General Composition of a Bounded Concurrent Black-Box Zero-Knowledge Protocol Hirofumi Muratani (TOSHIBA) |
We consider the round-complexity of an $m$-bounded concurrent black-box zero-knowledge interactive proof protocol. In th... [more] | ISEC2006-7 pp.45-52 |
| COMP | 2006-03-23 15:05 |
Tokyo | The University of Electro-Communications | Improvement of the Round Complexity of Perfectly Concealing Bit Commitment Schemes Yoshiharu Seri, Takeshi Koshiba (Saitama Univ.) |
We improve the upper bound on the round complexity for perfectly concealing bit commitment schemes based on the general ... [more] | COMP2005-68 pp.39-46 |
[Return to Top Page]