| 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 # | |
| CAS, CS | 2024-03-14 15:10 |
Okinawa | [Special Invited Talk]
Challenges and Future Direction in Message-Passing Demodulation Keigo Takeuchi (TUT)  CAS2023-121 CS2023-114 |
Message-passing demodulation is a promising method for demodulation in massive multiple-input multiple-output (MIMO) upl... [more] | CAS2023-121 CS2023-114 pp.58-63 |
|
| ITS, IE, ITE-MMS, ITE-ME, ITE-AIT [detail] | 2024-02-19 13:30 |
Hokkaido | Hokkaido Univ. | Characteristic analysis to improve the performance of graph-based methods in approximate nearest neighbor search Tomohiro Kanaumi, Yusuke Matsui (Univ. Tokyo) ITS2023-52 IE2023-41 |
Approximate nearest neighbor search (ANNS) is the problem of finding the nearest vector to a given query vector in a dat... [more] | ITS2023-52 IE2023-41 pp.34-39 |
| MRIS, ITE-MMS | 2023-06-08 14:20 |
Miyagi | Tohoku Univ. （RIEC) (Primary: On-site, Secondary: Online) |
[Invited Talk]
Computing in pursuit of energy efficiency
-- From the perspective of non-volatile memory circuits using MTJ -- Kimiyoshi Usami (Shibaura IT) MRIS2023-3 |
From AlphaGo which defeated a professional human GO player up to automatic driving of cars and the very recent ChatGPT, ... [more] | MRIS2023-3 pp.13-20 |
| SIP | 2022-08-25 16:30 |
Okinawa | Nobumoto Ohama Memorial Hall (Ishigaki Island) (Primary: On-site, Secondary: Online) |
[Invited Talk]
Approximate Message Passing for Efficient Grant-Free Access Takanori Hara (Tokyo Univ. of Science) SIP2022-59 |
To accommodate a large number of users efficiently, grant-free non-orthogonal multiple access has gained much attention.... [more] | SIP2022-59 pp.50-55 |
| RCS, SIP, IT | 2022-01-21 11:45 |
Online | Online | Simultaneous matrix diagonalization using alternating least-squares algorithm Shinya Saito, Kunio Oishi (Tokyo University of Tech.) IT2021-73 SIP2021-81 RCS2021-241 |
This paper presents an approach for overdetermined blind source separation (BSS) using AJD. The approach is constructed ... [more] | IT2021-73 SIP2021-81 RCS2021-241 pp.252-257 |
| IE | 2021-01-21 13:25 |
Online | Online | [Invited Talk]
High-Performance Computing for Image Processing Norishige Fukushima (NITech) IE2020-35 |
As cameras become higher resolution, the demand for high-performance image processing continues to increase. In this ... [more] |
IE2020-35 p.7 |
| SIP, IT, RCS | 2021-01-21 14:40 |
Online | Online | [Invited Talk]
Message passing algorithms for nonconvex penalties Ayaka Sakata (ISM) IT2020-79 SIP2020-57 RCS2020-170 |
We consider compressed sensing formulated as a minimization problem of nonconvex sparse penalties, Smoothly Clipped Abso... [more] | IT2020-79 SIP2020-57 RCS2020-170 pp.93-98 |
| NLP, NC (Joint) |
2019-01-24 15:00 |
Hokkaido | The Centennial Hall, Hokkaido Univ. | A Genetic Algorithm-Based Method for Finding Approximate Solutions to Minimum Steiner Tree Problems Li-Ping Zhang, Norikazu Takahashi (Okayama Univ.), Zong-Xiao Yang (HAUST) NLP2018-121 |
The Euclidean Steiner Tree Problem (ESTP) is a classical combinatorial optimization problem that appears in various fiel... [more] | NLP2018-121 pp.131-136 |
| SIP, IT, RCS | 2018-01-23 13:10 |
Kagawa | Sunport Hall Takamatsu | [Invited Talk]
A New Development in Message-Passing Demodulation: Expectation Propagation Keigo Takeuchi (TUT) IT2017-97 SIP2017-105 RCS2017-311 |
Expectation propagation (EP) is reviewed as a new demodulation scheme based on message passing in massive multiple-input... [more] | IT2017-97 SIP2017-105 RCS2017-311 pp.249-254 |
| IBISML | 2015-11-27 14:00 |
Ibaraki | Epochal Tsukuba | [Poster Presentation]
Performance degradation of AMP for Ising perceptron when the system size is small Arise Kuriya, Toshiyuki Tanaka (Kyoto Univ.) IBISML2015-85 |
Approximate Massage Passing (AMP) algorithm, proposed by Donoho et al., is derived from Belief Propagation (BP) algorith... [more] | IBISML2015-85 pp.241-247 |
| COMP | 2014-12-05 15:25 |
Kumamoto | Sojo University | Homomorphism-Substitutable Context-free Languages and Learning Algorithm Takayuki Kuriyama (Sokendai/ NII) COMP2014-38 |
We generalized the class of $k,l$-substitutable languages (Yoshinala, 2008). Each language in the generalized class is c... [more] | COMP2014-38 pp.37-44 |
| EMM, ISEC, SITE, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] | 2012-07-20 14:20 |
Hokkaido | An Improved Algorithm for Approximate GCD Problems Atsushi Takayasu, Noboru Kunihiro (UT) ISEC2012-35 SITE2012-31 ICSS2012-37 EMM2012-27 |
In this paper, we analyze multivariate approximate common divisor problem(ACDP), given approximate multiples of the inte... [more] | ISEC2012-35 SITE2012-31 ICSS2012-37 EMM2012-27 pp.189-194 |
|
| MBE | 2011-07-09 10:00 |
Tokushima | The University of Tokushima | An Automatic Scheduling Method of Clinical Exercises Hisashi Miyazaki, Isao Kayano, Osamu Hiramatsu (Kawasaki Univ), Sousuke Amasaki (Okayama Prefectural Univ) MBE2011-31 |
In this paper, we propose an automatic scheduling method of clinical exercises using tabu search that is one of the meta... [more] | MBE2011-31 pp.59-63 |
| VLD | 2010-03-12 11:15 |
Okinawa | A Comparison of Two Approximate String Matching Algorithms Implemented on an FPGA Keisuke Shimizu, Hiroki Nakahara, Tsutomu Sasao, Munehiro Matsuura (Kyushu Inst. of Tech.) VLD2009-123 |
An approximate string matching finds the most similar pattern in the text. A dynamic programming is used for the approx... [more] |
VLD2009-123 pp.145-150 |
|
| PRMU | 2009-03-14 13:15 |
Miyagi | Tohoku Institute of Technology | Approximate nearest neighbor search algorithm on HDD based on B+ tree. Noritaka Himei, Toshikazu Wada (Wakayama Univ.) PRMU2008-273 |
Nearest Neighbor (NN) search plays important roles in example-based Computer Vision algorithms. Accelerating NN search i... [more] | PRMU2008-273 pp.223-228 |
| DE | 2008-09-21 14:45 |
Fukushima | [Invited Talk]
Approximate Queries on String Collections Xiaochun Yang, Bin Wang (Northeastern Univ., China), Chen Li (UC Irvine) DE2008-31 |
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking... [more] | DE2008-31 pp.3-4 |
|
| NC | 2007-03-14 09:30 |
Tokyo | Tamagawa University | On the Two Kullback Divergences in Approximating Bayesian Posterior Distributions Kazuho Watanabe, Sumio Watanabe (Tokyo Inst. of Tech.) |
Some methods have been proposed and used for approximating Bayesian learning.Although they have provided efficient learn... [more] | NC2006-134 pp.97-102 |
[Return to Top Page]