| 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 # | |
| MBE, NC | 2022-12-03 16:40 |
Osaka | Osaka Electro-Communication University | Correlation-based discretization method of continuous variables in annealing machines Yuki Furue (Saitama Univ.), Makiko Konoshima (Fujitsu), Hirotaka Tamura (DXR Lab. Inc.), Jun Ohkubo (Saitama Univ.)  MBE2022-42 NC2022-64 |
Recently, annealing hardware specialized to combinatorial optimization problems has been developed, and there are some s... [more] | MBE2022-42 NC2022-64 pp.98-103 |
| EA | 2015-12-11 15:15 |
Ishikawa | Kanazawa Univ., Satellite Plaza | [Poster Presentation]
Effect of discretization spacing on sound field reproduction of reverberant room Hikaru Watabe (Shinshu Univ.), Makoto Otani (Kyoto Univ.), Takao Tsuchiya (Doshisha Univ.), Yukio Iwaya (TGU) EA2015-44 |
In sound field reproduction such as wave field synthesis, a coarse discretization interval of boundary surface that is l... [more] | EA2015-44 pp.23-26 |
| EA | 2014-12-13 09:30 |
Ishikawa | Satellite Plaza of Kanazawa University | [Poster Presentation]
Effect of discretization spacing on reproduction accuracy in wave field synthesis Hikaru Watabe (Shinshu Univ), Makoto Otani (Kyoto Univ), Takao Tsuchiya (Doshisha Univ), Yukio Iwaya (Tohoku Gakuin Univ) EA2014-51 |
Wave field synthesis (WFS) and a principle of boundary surface control (BoSC) etc. have been proposed to realize a repro... [more] | EA2014-51 pp.55-58 |
| NLP | 2014-12-03 15:50 |
Tokyo | Kyoto Univ. Tokyo Office | On random numbers used in discritization of position information in discrete PSOs Yoshihiko Hayakawa, Hidehiro Nakano, Arata Miyauchi (Tokyo City Univ.) NLP2014-105 |
Discrete PSO is an algorithm to solve discrete optimization problems. The discrete PSO obtains solutions for the probl... [more] |
NLP2014-105 pp.35-40 |
| NLP | 2014-07-01 10:00 |
Miyagi | Tohoku Univ. | Learning Restricted Boltzmann Machine with discrete learning parameter Seitaro Shinagawa (Tohoku Univ.), Yoshihiro Hayakawa (SNCT), Shigeo Sato, Takeshi Onomi, Koji Nakajima (Tohoku Univ.) NLP2014-27 |
Recently, the method of Deep Neural Network (DNN) with hierarchical learning has been remarkable for performance to solv... [more] | NLP2014-27 pp.37-40 |
| IBISML | 2012-06-20 14:50 |
Kyoto | Campus plaza Kyoto | An MDL-based Change-Detection Algorithm for Piecewise Stationay Memoryless Sources with Multi-dimensional Parameter Hiroki Kanazawa, Kenji Yamanishi (Univ. of Tokyo) IBISML2012-9 |
Kleinberg has proposed an algorithm for detecting bursts from a data sequence, which has turned out to be effective in t... [more] | IBISML2012-9 pp.57-64 |
| IBISML | 2010-06-15 17:00 |
Tokyo | Takeda Hall, Univ. Tokyo | The Coding Divergence for Measuring the Complexity of Separating Two Sets Mahito Sugiyama, Akihiro Yamamoto (Kyoto Univ.) IBISML2010-26 |
In this paper, we integrate two essential processes, discretization of real-valued data and learning of models explainin... [more] | IBISML2010-26 pp.181-187 |
| SDM, VLD | 2006-09-26 10:25 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | To be announced Yoshio Ashizawa, Hideki Oka (FUJITSU LABORATORIES) |
The density gradient approach is presented to device characteristics analysis with random dopant fluctuations. We invest... [more] | VLD2006-40 SDM2006-161 pp.7-12 |
| EA | 2006-07-14 15:15 |
Saitama | Pioneer Corporate Research and Development Laboratories | On Numerical Simulation Errors of Physical Models for Music Sound Generation Yoshimitsu Takasawa (UEC) |
The partial frequencies of the transverse vibrations of a string which has stiffness form an inharmonic series. For mu... [more] |
EA2006-31 pp.39-42 |
| PRMU | 2005-12-16 13:00 |
Niigata | Niigata Univ. | Adaptive Subspace Splitting Using Minimum-Description-Length-Principles for Efficient Boosting Duy-Dinh Le (Sokendai), Shin'ichi Satoh (NII) |
In RealBoost learning, selecting best weak classifiers is one of the most significant tasks. Generally, it is done accor... [more] | PRMU2005-130 pp.13-18 |
[Return to Top Page]