Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
RCS, IT, SIP |
2016-01-18 10:10 |
Osaka |
Kwansei Gakuin Univ. Osaka Umeda Campus |
A Note on Unequal Error Protection in Random Network Coding Tomohiko Saito (Tokyo City Univ.), Koki Kazama (Waseda Univ.), Toshihiro Niinomi (Tokyo City Univ.), Toshiyasu Matsushima (Waseda Univ.) IT2015-48 SIP2015-62 RCS2015-280 |
Unequal Error Protection (UEP) codes were proposed by Masnick et al. and organized by Dunning, Gils and so on. On the ot... [more] |
IT2015-48 SIP2015-62 RCS2015-280 pp.1-6 |
RCS, IT, SIP |
2016-01-18 10:35 |
Osaka |
Kwansei Gakuin Univ. Osaka Umeda Campus |
A Study on Soft Decision Decoding for Array-Error Channel Koki Kazama, Akira Kamatsuka, Toshiyasu Matsushima (Waseda Univ.) IT2015-49 SIP2015-63 RCS2015-281 |
[more] |
IT2015-49 SIP2015-63 RCS2015-281 pp.7-12 |
RCS, IT, SIP |
2016-01-18 11:00 |
Osaka |
Kwansei Gakuin Univ. Osaka Umeda Campus |
A Study on Message Passing Algorithm for Counting Short Cycles in Sparse Bipartite Graphs Yuta Nakahara, Shota Saito, Toshiyasu Matsushima (Waseda Univ.) IT2015-50 SIP2015-64 RCS2015-282 |
In this paper, we propose an improvement of message passing algorithm for counting short cycles in sparse bipartite grap... [more] |
IT2015-50 SIP2015-64 RCS2015-282 pp.13-18 |
IT |
2015-09-04 09:00 |
Ishikawa |
Hakusan Shobutei |
Linear Programming Decoding of Binary Linear Codes over Symbol-Pair Read Channels Shunsuke Horii, Toshiyasu Matsushima, Shigeichi Hirasawa (Waseda Univ.) IT2015-34 |
In this paper, we develop a new decoding algorithm of a binary linear codes for symbol-pair read channels.
Symbol-pair ... [more] |
IT2015-34 pp.1-6 |
IT |
2015-09-04 14:50 |
Ishikawa |
Hakusan Shobutei |
On decoding of Polar codes using search algorithm Akira Kamatsuka, Toshiyasu Matsushima (Waseda Univ.) IT2015-43 |
Polar codes and successive cancelation (SC) decoding was proved to achieve capacity on binary discrete memoryless symmet... [more] |
IT2015-43 pp.55-60 |
IT |
2015-07-13 10:00 |
Tokyo |
Tokyo Institute of Technology |
Variations of the Strong Converse Theorem on the Intrinsic Randomness Problem for General Sources Shota Saito, Toshiyasu Matsushima (Waseda Univ.) IT2015-17 |
This study deals with the Intrinsic randomness problem for general sources.
Previous study shows that the necessary and... [more] |
IT2015-17 pp.1-6 |
IT |
2015-07-14 11:45 |
Tokyo |
Tokyo Institute of Technology |
On the Bayes Optimal Prediction of Time Series under a Nonstationary Weibull Distribution Daiki Koizumi (Otaru Univ. of Commerce), Toshiyasu Matsushima (Waseda Univ.) IT2015-33 |
[more] |
IT2015-33 pp.95-100 |
ISEC, IT, WBS |
2015-03-02 17:05 |
Fukuoka |
The University of Kitakyushu |
Another Representation on the Second-Order Achievable Rate Region of Slepian-Wolf Coding Problem for General Sources Shota Saito, Nozomi Miya, Toshiyasu Matsushima (Waseda Univ.) IT2014-87 ISEC2014-100 WBS2014-79 |
In this paper, we deal with the Slepian-Wolf coding problem for general sources. Previously, the first-order $epsilon$-a... [more] |
IT2014-87 ISEC2014-100 WBS2014-79 pp.159-165 |
IBISML |
2014-11-18 15:00 |
Aichi |
Nagoya Univ. |
[Poster Presentation]
A Note on Attack Against Nonlinear Combiner Generator Using Sum-Product Algorithm Kota Kubo, Shota Saito, Akira Kamatsuka, Toshiyasu Matsushima (Waseda Univ.) IBISML2014-83 |
When parameters have some restrictions, we can present it on a graphical model and find the values of unknown parameters... [more] |
IBISML2014-83 pp.357-364 |
PRMU, IBISML, IPSJ-CVIM [detail] |
2014-09-01 10:00 |
Ibaraki |
|
A Note on Improvement in the Rate of a Prediction Error of AdaBoost in Pattern Recognition Hideyuki Masui, Ryoma Tsuduki, Nozomi Miya, Toshiyasu Matsushima (Waseda Univ.) PRMU2014-36 IBISML2014-17 |
AdaBoost is an algorithm used for pattern recognition. This algorithm successively makes the model which minimizes an er... [more] |
PRMU2014-36 IBISML2014-17 pp.1-6 |
IT |
2014-07-17 14:50 |
Hyogo |
Kobe University |
A study of a MDP-based recommender system when the class of user who is recommended items is unknown Shusuke Iwai, Nozomi Miya (Waseda Univ.), Yasunari Maeda (Kitami Institute of Technology), Toshiyasu Matsushima (Waseda Univ.) IT2014-20 |
Recommender system is a system that gives users objects,information and items they want.In previous studies,recommendati... [more] |
IT2014-20 pp.49-54 |
IT |
2014-07-17 15:15 |
Hyogo |
Kobe University |
A Note on Optimal Control System for Selective-Repeat Hybrid SR-ARQ with a Finite Length Buffer Yuta Kageyama, Akira Kamatsuka (Waseda Univ.), Yasunari Maeda (Kitami Institute of Technology), Toshiyasu Matsushima (Waseda Univ.) IT2014-21 |
Hybrid ARQ is one of the error correction scheme.It is Combination of ARQ and FEC.Algorithms for throughput maximization... [more] |
IT2014-21 pp.55-58 |
IT |
2014-07-17 17:40 |
Hyogo |
Kobe University |
[Invited Talk]
How to Observe Probability Distribution of Self-Information
-- as viewed under different resolutions of $n^{-1}$ and $n^{-1/2}$ -- Toshiyasu Matsushima (Waseda Univ.) IT2014-26 |
Several problems in Information Theory are investigated by asymptotic approximations of the probability of self-informat... [more] |
IT2014-26 pp.83-88 |
IT |
2013-09-27 10:15 |
Okinawa |
Culture Resort Festone (Okinawa) |
Iterative Multiuser Joint Decoding based on Augmented Lagrangian Method Shunsuke Horii, Tota Suko, Toshiyasu Matsushima, Shigeichi Hirasawa (Waseda Univ.) IT2013-34 |
In this paper, we develop an iterative multiuser joint decoding of
code-division multiple-access (CDMA) signals based ... [more] |
IT2013-34 pp.13-17 |
IT |
2013-07-25 15:30 |
Tokyo |
Nishi-Waseda campus, Waseda University |
A Consideration on Modeling and Optimality of Regenerating Codes Considering Security of Shares Takahiro Yoshida (Yokohama College of Commerce), Hajime Jinushi (Aoyama Gakuin Univ.), Toshiyasu Matsushima (Waseda Univ.) IT2013-16 |
e consider regenerating codes. Regenerating codes are a class of codes for distributed storage systems that enable a dat... [more] |
IT2013-16 pp.27-32 |
IT, ISEC, WBS |
2013-03-07 14:30 |
Osaka |
Kwansei Gakuin Univ., Osaka-Umeda Campus |
A consideration on minimum storage regenerating codes for functions Takahiro Yoshida, Hajime Jinushi (Aoyama Gakuin Univ.), Toshiyasu Matsushima (Waseda Univ.) IT2012-78 ISEC2012-96 WBS2012-64 |
We consider regenerating codes for functions. Regenerating codes are a class of codes for distributed storage systems th... [more] |
IT2012-78 ISEC2012-96 WBS2012-64 pp.107-112 |
IBISML |
2013-03-05 09:55 |
Aichi |
Nagoya Institute of Technology |
A Privacy Preserving Distributed Calculation Method of Maximum A Posteriori Estimator for Linear Regression Models Akito Nakai, Tota Suko, Toshiyasu Matsushima (Waseda Univ.) IBISML2012-99 |
In this paper, we study a privacy preserving linear regression analysis. In the past, some protocols of distributed calc... [more] |
IBISML2012-99 pp.47-54 |
IBISML |
2013-03-05 15:40 |
Aichi |
Nagoya Institute of Technology |
Hierarchical Multi-label Classification on Statistical Decision Theory Kiyohito Yamamoto, Tota Suko, Toshiyasu Matsushima (Waseda Univ.) IBISML2012-107 |
This paper considers multi-label classification on statistical decision theory. In Label Power Set format, multi-label c... [more] |
IBISML2012-107 pp.101-106 |
IBISML |
2012-11-07 15:30 |
Tokyo |
Bunkyo School Building, Tokyo Campus, Tsukuba Univ. |
A Privacy Preserving Distributed Calculation Method of Least-squares Estimator for Linear Regression Models Tota Suko, Shunsuke Horii (Waseda Univ), Manabu Kobayashi (Shonan Institute of Tec), Masayuki Goto, Toshiyasu Matsushima, Shigeichi Hirasawa (Waseda Univ) IBISML2012-49 |
In this paper, we study a privacy preserving linear regression analysis. We propose a new protocol of distributed calcul... [more] |
IBISML2012-49 pp.107-111 |
IT |
2012-09-28 11:05 |
Gunma |
Kusatsu Seminar House |
Linear Programming Decoding for Multiple Access Channel based on Decomposition Methods Shunsuke Horii, Toshiyasu Matsushima (Waseda Univ.) IT2012-40 |
In this paper, we develop a dual decomposition method based linear-programming (LP) decoding for multiple-access channel... [more] |
IT2012-40 pp.53-58 |