| 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 # | |
| COMP | 2019-12-13 17:50 |
Gunma | Ikaho Seminar House, Gunma University | Depth Two Majority Circuits for Majority Yasuhiro Ojima, Takuya Yokokawa, Kazuyuki Amano (Gunma Univ.)  COMP2019-44 |
Let $MAJ_n$ denote the Boolean majority function of $n$ input variables. In this paper, we study the construction of de... [more] |
COMP2019-44 pp.109-115 |
| VLD, DC, CPSY, RECONF, CPM, ICD, IE, IPSJ-SLDM, IPSJ-EMB, IPSJ-ARC (Joint) [detail] |
2017-11-07 11:20 |
Kumamoto | Kumamoto-Kenminkouryukan Parea | Implementation and Optimization of Parallel Prefix Adder Using Majority Function Daiki Matsumoto, Masao Yanagisawa, Shinji Kimura (Waseda Univ.) VLD2017-46 DC2017-52 |
In recent FPGAs and post CMOS devices, three-input majority operation can be efficiently realized and circuit configuration... [more] | VLD2017-46 DC2017-52 pp.109-114 |
| IBISML | 2017-03-07 11:30 |
Tokyo | Tokyo Institute of Technology | A stochastic optimization method and generalization bounds for voting classifiers by continuous density functions Atsushi Nitanda (Tokyo Tech./NTTDATA MSI), Taiji Suzuki (Tokyo Tech./JST/RIKEN) IBISML2016-108 |
We consider a learning method for the majority vote classifier by probability measure on continuously parametrized space... [more] | IBISML2016-108 pp.63-69 |
| IBISML | 2016-11-17 14:00 |
Kyoto | Kyoto Univ. | [Poster Presentation]
Stochastic Particle Gradient Descent for the Infinite Majority Vote Classifier Atsushi Nitanda, Taiji Suzuki (Tokyo Tech.) IBISML2016-79 |
We consider a learning method for the infinite majority vote classifier combined by a density on a continuous space of b... [more] | IBISML2016-79 pp.235-241 |
| COMP | 2015-10-02 14:00 |
Tokyo | Some Aspects of Commutation in Clone Theory Hajime Machida COMP2015-26 |
Clone theory is motivated by logic (multiple-valued logic), algebra (universal algebra) and computer science (switching ... [more] | COMP2015-26 pp.23-28 |
|
| IBISML | 2010-06-14 16:25 |
Tokyo | Takeda Hall, Univ. Tokyo | Privacy Preservation in Online Prediction Jun Sakuma (Univ. of Tsukuba/JST), Hiromi Arai (U. Tsukuba) IBISML2010-9 |
In this paper, we consider online prediction from expert advice in a situation where each expert observes its own loss a... [more] | IBISML2010-9 pp.49-56 |
| COMP | 2008-12-03 14:35 |
Gunma | Gunma Univ. | Improved Formula Size Lower Bounds for Monotone Self-Dual Boolean Functions Kenya Ueno (Univ. of Tokyo) COMP2008-51 |
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduc... [more] | COMP2008-51 pp.33-40 |
| COMP | 2006-06-23 11:10 |
Saitama | Saitama Univ. | Reductions for Monotone Boolean Circuits Kazuo Iwama, Hiroki Morizumi (Kyoto Univ.) |
The large class, say {\it NLOG}, of Boolean functions, including 0-1 Sort and 0-1 Merge, have an upper bound of $O(n\log... [more] | COMP2006-19 pp.15-19 |
[Return to Top Page]