Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
HWS, VLD [detail] |
2020-03-05 16:00 |
Okinawa |
Okinawa Ken Seinen Kaikan (Cancelled but technical report was issued) |
Approximate Floating Point Multiplier based on Shifting Addition Using Carry Signal from Second-Highest-Bit Jie Li, Yi Guo, Shinji Kimura (Waseda Univ.) VLD2019-120 HWS2019-93 |
Approximate computing (AC) sacrifices accuracy for better hardware performance since it relaxes the requirement of exact... [more] |
VLD2019-120 HWS2019-93 pp.151-156 |
AP, RCS (Joint) |
2019-11-20 13:10 |
Saga |
Saga Univ. |
Signal detection using Approximate Message Passing with node selection in Massive MIMO System Wakaba Tsujimoto, Toshihiko Nishimura, Takeo Ohgane, Yasutaka Ogawa, Junichiro Hagiwara (Hokkaido Univ.) RCS2019-210 |
Approximate message passing (AMP), originally proposed in the field of compressed sensing, is applicable to detection of... [more] |
RCS2019-210 pp.43-47 |
RCS, SAT (Joint) |
2019-08-22 09:50 |
Aichi |
Nagoya University |
Generalized Boosted Approximate Message Passing for Uplink Grant-Free Non-Orthogonal Multiple Access Takanori Hara, Koji Ishibashi (The Univ. of Electro-Communications) RCS2019-148 |
In this paper, we propose low complexity active user detection (AUD), channel estimation (CE), and multiuser detection (... [more] |
RCS2019-148 pp.13-18 |
EA, SIP, SP |
2019-03-14 10:25 |
Nagasaki |
i+Land nagasaki (Nagasaki-shi) |
Blind speech separation based on approximate joint diagonalization utilizing correlation between neighboring frequency bins Taiki Asamizu, Toshihiro Furukawa (TUS) EA2018-100 SIP2018-106 SP2018-62 |
In this paper, we propose a new method that extends the approximate joint diagonalization blind speech separation (BSS).... [more] |
EA2018-100 SIP2018-106 SP2018-62 pp.7-12 |
RCS, SIP, IT |
2019-01-31 12:30 |
Osaka |
Osaka University |
Trainable ISTA
-- Deep learning-based iterative algorithm for sparse signal recovery -- Satoshi Takabe, Tadashi Wadayama (NITech) IT2018-45 SIP2018-75 RCS2018-252 |
(To be available after the conference date) [more] |
IT2018-45 SIP2018-75 RCS2018-252 pp.61-66 |
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 |
EE, CPM, OME |
2018-11-21 15:50 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
[Special Talk]
Application of the Approximate 2-Degree-of-Freedom Algorithm for Improving Transient Response of Low-Voltage, High-Current POL Converters Soichiro Shimokawa (Sanken Ele.), Kohji Higuchi (R&D UEC ASEAN RESEARCH CENTER), Masaru Nakamura, Shinji Aso, Masao Ueno, Kengo Koke (Sanken Ele.) EE2018-32 CPM2018-60 OME2018-20 |
LSIs such as FPGAs used in servers and telecommunication equipments are being developed at lower voltages and higher cur... [more] |
EE2018-32 CPM2018-60 OME2018-20 pp.35-40 |
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 |
SANE |
2017-11-23 15:40 |
Overseas |
Malaysia (Borneo Island) |
Smart Antenna System for Unknown Uncorrelated Source Groups in Multipath Environment Ahmad Aminu (Kanopoly), Wan Azlan Wan Zainal Abidin, Kismet Anag Hong Ping (UNIMAS), Ibrahim Abba (Kanopoly) SANE2017-71 |
Abstract This study presents smart antenna system for unknown uncorrelated source groups containing coherent signals. T... [more] |
SANE2017-71 pp.45-49 |
VLD |
2017-03-01 15:55 |
Okinawa |
Okinawa Seinen Kaikan |
A Design Technique for Approximate Circuits based on Artificial Neural Network Kazushi Kawamura, Masao Yanagisawa, Nozomu Togawa (Waseda Univ.) VLD2016-106 |
This paper proposes a design technique for approximate circuits based on artificial neural network, and then evaluates t... [more] |
VLD2016-106 pp.25-30 |
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 |
CPSY, DC, IPSJ-ARC (Joint) [detail] |
2015-08-06 13:30 |
Oita |
B-Con Plaza (Beppu) |
Parallelization of Approximate String Matching Based on Computation of Prefix Sums Yasuaki Mitani, Fumihiko Ino, Kenichi Hagihara (Osaka Univ.) CPSY2015-39 |
In this paper, aiming at accelerating string search, we propose a parallel method for a shift-or algorithm. Our method a... [more] |
CPSY2015-39 pp.229-234 |
IBISML |
2015-03-06 15:45 |
Kyoto |
Kyoto University |
Model selection with approximate validation error guarantee for (L^2_2) regularized convex loss minimization problems Atsushi Shibagaki, Yoshiki Suzuki, Ichiro Takeuchi (NIT) IBISML2014-96 |
In this paper we propose a new algorithm that can select an approximately optimal regularization parameter in a class of... [more] |
IBISML2014-96 pp.79-86 |
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 |
IBISML |
2014-11-17 17:00 |
Aichi |
Nagoya Univ. |
[Poster Presentation]
Application of partial parallel interference cancellation to sparse signal recovery Koujin Takeda (Ibaraki Univ.), Toshiyuki Tanaka (Kyoto Univ.) IBISML2014-35 |
We apply partial parallel interference cancellation scheme in CDMA demodulation to sparse signal recovery in compressed ... [more] |
IBISML2014-35 pp.1-7 |
IBISML |
2014-03-07 11:10 |
Nara |
Nara Women's University |
Blind Separation of Sparse and Smooth Signals via Approximate Message Passing Algorithm Shigeki Yokoyama, Toshiyuki Tanaka (Kyoto Univ.) IBISML2013-76 |
We consider the problem to recover source signals from noisy mixed ones. This can be described as a matrix reconstructio... [more] |
IBISML2013-76 pp.71-78 |
NS, IN (Joint) |
2014-03-07 08:50 |
Miyazaki |
Miyazaki Seagia |
Sever Location Method for Keeping Shorter Distance from Clients to Servers during Failures Nao Maeda, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2013-243 |
Recently, large contents in the Internet have increased loads of contents servers, networks and data centers which may d... [more] |
NS2013-243 pp.385-390 |
COMP |
2013-04-24 10:35 |
Hyogo |
Kobe University |
Approximate Permuted Pattern Matching and Indexing Structure for Multi-Track Data Hiroyuki Ota, Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2013-2 |
A multi-track data is a multi-set of sequences.
The permuted pattern matching problem is, given a multi-track text and ... [more] |
COMP2013-2 pp.9-16 |
PRMU |
2013-02-22 10:00 |
Osaka |
|
Grafting Trees A Nearest Neighbor Srarch Algorithm without Distance Computation Yohei Ohtani, Toshikazu Wada, Hiroshi Oike (Wakayama Univ.) PRMU2012-162 |
This report presents a nearest neighbor search algorithm without distance computation. K-D tree based nearest neighbor s... [more] |
PRMU2012-162 pp.137-142 |
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 |