| 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 # | |
| WBS, IT, ISEC | 2021-03-05 14:45 |
Online | Online | Analysis of Optimal Error Exponents on Classification for Markov Sources Hiroto Kuramata, Hideki Yagi, Tsutomu Kawabata (UEC)  IT2020-152 ISEC2020-82 WBS2020-71 |
We consider a classification problem for a test sequence to determine from which source the sequence generates. The syst... [more] | IT2020-152 ISEC2020-82 WBS2020-71 pp.245-250 |
| IT | 2020-12-02 11:30 |
Online | Online | Redundancy Analysis of the Weighted Symbol Decomposition Method with a Finite Window
-- Case with the Zero-Redundancy Estimator -- Yusuke Hashimoto, Tsutomu Kawabata (UEC) IT2020-35 |
[more] | IT2020-35 pp.62-66 |
| IT | 2019-07-26 13:30 |
Tokyo | NATULUCK-Iidabashi-Higashiguchi Ekimaeten | [Invited Talk]
Information and Dimension in Source Coding Tsutomu Kawabata (UEC) IT2019-25 |
[more] | IT2019-25 p.55 |
| IT, ISEC, WBS | 2019-03-07 09:30 |
Tokyo | University of Electro-Communications | Analysis of Zero-Redundancy Estimator with a Finite Window for Markovian Source
-- When the Statewise Alphabets are Unknown -- Yusuke Hashimoto, Tstutomu Kawabata (Univ. of Electro-Comm.) IT2018-89 ISEC2018-95 WBS2018-90 |
A Bayesian (Laplace or Krichevski-Trofimov) estimator for Markov source can be used to build a lossless source code. Ho... [more] |
IT2018-89 ISEC2018-95 WBS2018-90 pp.85-90 |
| WBS, IT, ISEC | 2018-03-08 09:50 |
Tokyo | Katsusika Campas, Tokyo University of Science | Redundancy Analysis of Univarsal Lossless Source Coding via Estimation of Prior
-- Relaxing an Ergodicity Condition -- Ryosuke Ikarashi, Tsutomu Kawabata (UEC) IT2017-105 ISEC2017-93 WBS2017-86 |
Bayesian mixture with non-discrete prior has an asymptotic redundancy proportional to the half of log data length, with ... [more] | IT2017-105 ISEC2017-93 WBS2017-86 pp.13-18 |
| 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 |
| IT, ISEC, WBS | 2016-03-10 10:40 |
Tokyo | The University of Electro-Communications | Redundancy of Bayesian Code with Markov Fractal Prior Distributions Naoya Matsukami, Tsutomu Kawabata (UEC) IT2015-103 ISEC2015-62 WBS2015-86 |
Bayesian code method is used as a standard in realizing a universal noiseless source code. For a memoryless source, a mi... [more] | IT2015-103 ISEC2015-62 WBS2015-86 pp.13-17 |
| IT | 2013-07-25 14:55 |
Tokyo | Nishi-Waseda campus, Waseda University | Interpolation of Reconstruction Condition for Compressed Sensing
-- Extended Implications of Restricted Isometry Property -- Shinsuke Nakajima, Tsutomu Kawabata (UEC) IT2013-15 |
It is fundamental in the compressed sensing, to consider a sufficient reconstruction condition in $l_{1}$ norm of a spa... [more] |
IT2013-15 pp.23-26 |
| IT | 2013-01-21 16:15 |
Tokyo | Univ. of Electro-Communications | Improvement of the symbol decomposition algorithm and its application to the word-valued sources Yuta Tadaki, Tsutomu Kawabata (The Univ. of Electro-Communications) IT2012-58 |
We consider the text compression based on probabilistic modeling. For a fixed length source alphabet, the symbol decomp... [more] |
IT2012-58 pp.53-57 |
| IT | 2012-12-11 15:20 |
Oita | Beppuwan Royal Hotel | [Invited Talk]
A Spread of Information Theory
-- What I learned in Stanford -- Tsutomu Kawabata (Univ. of Electro-Commun.) IT2012-46 |
[more] | IT2012-46 pp.7-11 |
| IT, ISEC, WBS | 2010-03-05 14:40 |
Nagano | Nagano-Engineering Campus, Shinshu University | Redundancy analysis of the universal source code with a singular prior Tatsuya Hashimoto, Tsutomu Kawabata (Univ. of Electro-Comm.) IT2009-125 ISEC2009-133 WBS2009-104 |
We consider the universal source coding with the class of source whose probability is parameterized over a continuous sp... [more] | IT2009-125 ISEC2009-133 WBS2009-104 pp.349-352 |
| IT | 2008-05-16 16:20 |
Wakayama | Wakayama University | Fast quantization with lp norm to the An lattice Kenichiro Takizawa, Hideki Yagi, Tsutomu Kawabata (UEC) IT2008-6 |
$A_{n}$ lattice is one of the root lattices and used for uniform quantization of a space. For $l_{2}$ norm, Conway and S... [more] | IT2008-6 pp.29-32 |
| IT | 2007-05-18 17:05 |
Yamagata | Denkoku-No-Mori (Yonezawa) | A Universal Portfolio Based on Context Tree Weighting Method Ryoma Fujita, Tsutomu Kawabata (UEC) IT2007-8 |
In stock market, an appropreate choice of portfolio inproves wealth achievement. In particular, there is a universal a... [more] |
IT2007-8 pp.43-47 |
[Return to Top Page]