| 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, IPSJ-AL | 2024-05-09 10:45 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Depth-Three Circuits for Inner Product and Majority Functions Kazuyuki Amano (Gunma Univ.) |
(To be available after the conference date) [more] | |
| SIP, SP, EA, IPSJ-SLP [detail] | 2024-02-29 15:10 |
Okinawa | (Primary: On-site, Secondary: Online) |
Cramér-Rao Lower Bound for Parameter Estimation from Observation with Irreversible Saturation Effects Natsuki Ueno, Hirokazu Kameoka (NTT)  EA2023-84 SIP2023-131 SP2023-66 |
For probabilistic models involving irreversible saturation effects, we provide extended definitions of the score functio... [more] | EA2023-84 SIP2023-131 SP2023-66 pp.139-144 |
| WBS, IT, ISEC | 2021-03-05 09:00 |
Online | Online | Relationships among Security Notions and Lower Bounds on Tags in Anonymous Broadcast Authentication Hirokazu Kobayashi (Yokohama National Univ..), Yohei Watanabe (The Univ. of Electro-Communications/AIST), Junji Shikata (Yokohama National Univ..) IT2020-143 ISEC2020-73 WBS2020-62 |
Watanabe et al. (SCIS2021) proposed Anonymous Broadcast Authentication (ABA) as a cryptographic primitive for remote con... [more] | IT2020-143 ISEC2020-73 WBS2020-62 pp.187-194 |
| PRMU | 2020-12-18 10:30 |
Online | Online | Pear Flower Cluster Detection Method Using Deep Learning and Branch Extraction Shunsuke Aoki, Tatsuya Yamazaki (Niigata Univ.) PRMU2020-55 |
Currently, manual pollination work in pear cultivation is a heavy burden for farmers, since a kind of pear has self-inco... [more] | PRMU2020-55 pp.99-104 |
| COMP | 2019-12-13 17:25 |
Gunma | Ikaho Seminar House, Gunma University | The Analysis of Anti-slide Kento Kimura, Kazuyuki Amano, Tetsuya Araki (Gunma Univ.) COMP2019-43 |
Let $n$ be a positive integer. Given an $ntimes ntimes n$ box and a number of pieces of some specified shape, we consi... [more] |
COMP2019-43 pp.101-107 |
| R | 2019-07-26 14:00 |
Iwate | Ichinoseki Cultural Center | Limit theorem of a connected-(r,s)-out-of-(m,n):F lattice system Koki Yamada, Taishin Nakamura, Hisashi Yamamoto, Lei Zhou, Xiao Xiao (Tokyo Met. Univ.) R2019-14 |
In previous studies, several methods for computing the reliability of a connected-(r,s)-out-of-(m,n):F lattice system ha... [more] | R2019-14 pp.1-6 |
| SR, RCS (Joint) (2nd) |
2018-10-30 10:30 |
Overseas | Mandarin Hotel, Bangkok, Thailand | [Poster Presentation]
Ambient Intelligent Wireless Sensor Network for Environmental Monitoring and Indoor Localization Using an Extended Kalman Filter Karthik Muthineni, Attaphongse Taparugssanagorn (AIT) |
In this work, we propose Ambient Intelligent (AmI) Wireless Sensor Network (WSN) that could monitor environment paramete... [more] | |
| COMP | 2018-10-26 15:00 |
Kyoto | Kyoto University | Upper and lower bounds on the OBDD-width of a special integer multiplication Tong Qin (Tokyo Tech) COMP2018-27 |
We consider a Boolean function ${rm SMul}_{n-1}^n$ that computes the middle bit of the multiplication of two natural num... [more] | COMP2018-27 pp.45-54 |
| HWS, ISEC, SITE, ICSS, EMM, IPSJ-CSEC, IPSJ-SPT [detail] | 2018-07-25 14:10 |
Hokkaido | Sapporo Convention Center | [Invited Talk]
Memory Lower Bounds of Reductions Revisited (from EUROCRYPT 2018) Yuyu Wang (Tokyo Tech/AIST/IOHK), Takahiro Matsuda, Goichiro Hanaoka (AIST), Keisuke Tanaka (Tokyo Tech) ISEC2018-24 SITE2018-16 HWS2018-21 ICSS2018-27 EMM2018-23 |
In this invited talk, we introduce the paper, “ Memory Lower Bounds of Reductions Revisited ” by Y. Wang, T. Matsuda, G.... [more] | ISEC2018-24 SITE2018-16 HWS2018-21 ICSS2018-27 EMM2018-23 p.93 |
| IT | 2017-07-14 10:00 |
Chiba | Chiba University | Asymptotic Tightness of The Shannon Lower Bound for R(D)
-- Another Proof for Self-Similar Memoryless Source -- Shingo Taguchi, Tsutomu Kawabata (UEC) IT2017-27 |
Although the asymptotic properties of the Shannon lower bound for the rate-distortion function are well known for contin... [more] | IT2017-27 pp.61-65 |
| COMP | 2016-10-21 14:30 |
Miyagi | Tohoku University | On lower bounds for the complexity of the Frobenius problem and its subproblems Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2016-28 |
In this paper, we lower bounds for the time complexity of the Frobenius problem. Given a set $A$ of coprime positive in... [more] | COMP2016-28 pp.35-37 |
| COMP | 2015-10-02 10:00 |
Tokyo | Upper and lower bounds and time complexities on the Frobenius problem obtained from analysing its additive structure Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2015-22 |
In this work, we investigate upper and lower bounds for the Frobenius problem, using some existing results in additive c... [more] | COMP2015-22 pp.1-5 |
|
| COMP, IPSJ-AL | 2015-06-13 08:30 |
Hokkaido | Fast Search Method for Moat Problems on Prime Elements in Imaginary Quadratic Fields Shinji Kinoshita, Hajime Matsui (TTI) COMP2015-10 |
The moat problems on prime elements in imaginary quadratic fields are unsolved problems that ``Can one walk to infinity ... [more] | COMP2015-10 pp.67-74 |
|
| COMP, IPSJ-AL | 2013-05-17 13:35 |
Hokkaido | Otaru University of Commerce | Query Complexity of Witness Finding Akinori Kawachi (Tokyo Inst. of Tech.), Benjamin Rossman (NII), Osamu Watanabe (Tokyo Inst. of Tech.) COMP2013-11 |
For any polynomial-time relation L subset_of {0,1}^m x {0,1}^n where n = m^{O(1)}, the classic search-to-decision reduct... [more] | COMP2013-11 pp.39-46 |
| SANE, SAT (Joint) |
2013-02-22 11:20 |
Okinawa | Youth Center of Okinawa prefecture | Optimization of Monopulse Angle Accuracy Based on Cramer-Rao Lower Bound Ryuhei Takahashi, Teruyuki Hara (Mitsubishi Electric Corp.) SANE2012-156 |
Monopulse angle estimation technique is widely used in phased array radar systems. Conventional monopulse angle accuracy... [more] | SANE2012-156 pp.43-48 |
| COMP | 2012-04-27 10:35 |
Osaka | Osaka Prefecture University | Reconstructing Strings from Substrings with Quantum Queries Richard Cleve (Univ. of Waterloo), Kazuo Iwama (Kyoto Univ.), Francois Le Gall (Univ. of Tokyo), Harumichi Nishimura (Nagoya Univ.), Seiichiro Tani (NTT), Junichi Teruyama (Kyoto Univ.), Shigeru Yamashita (Ritsumeikan Univ.) COMP2012-2 |
This paper investigates the number of quantum queries made to solve the problem of reconstructing an unknown string fro... [more] |
COMP2012-2 pp.7-14 |
| COMP | 2011-06-30 14:40 |
Hiroshima | Hiroshima Univ. | On the Constant Depth Circuit Complexity of Subgraph Isomorphism on Random Graphs Koutarou Nakagawa (Tokyo Inst. of Tech.) COMP2011-20 |
The AC$^0$ circuit complexity of $k$-clique on random graphs is already known. Rossman established the lower bound $n^{\... [more] | COMP2011-20 pp.33-37 |
| IT | 2011-05-20 15:25 |
Osaka | Osaka City University | A Note on the Partition by Defining Set and the Weight Distributions for Cyclic Codes (Part 2) Takayasu Kaida (Kinki Univ.), Junru Zheng (Kyushu Women's Univ.) IT2011-7 |
The partition of cyclic codes defined by the defining sets and concept of a sequence of the defining set are induced. ... [more] |
IT2011-7 pp.37-40 |
| ISEC, IT, WBS | 2011-03-03 10:00 |
Osaka | Osaka University | A Note on the Partition by Defining Set and the Weight Distributions for Cyclic Codes Takayasu Kaida (Kinki Univ.), Junru Zheng (Kyuhsu Women's Univ.) IT2010-78 ISEC2010-82 WBS2010-57 |
The partition of cyclic codes defined by the defining sets and concept of a sequence of the defining set are induced. ... [more] |
IT2010-78 ISEC2010-82 WBS2010-57 pp.65-68 |
| PRMU | 2009-11-26 10:00 |
Ishikawa | Ishikawa Industrial Promotion Center | Visualization of precipitation particles in the lower atmosphere using lidars and radars Kenji Nakamura, Mamoru Kubo, Ken-ichiro Muramoto (Kanazawa Univ.), Toru Shiina (Toyama Natl. Coll. of Tech.), Tadayasu Ohigashi, Taro Shinoda (Nagoya Univ.) PRMU2009-98 |
It has been shown that clouds are very complex in both the horizontal and vertical directions. Examination of the behavi... [more] | PRMU2009-98 pp.33-38 |
[Return to Top Page]