| 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 | 2024-03-14 16:30 |
Tokyo | The University of Electro-Communications | A consideration on the spannig polytope volume using the recurrence representation and its computation Ei Ando (Senshu Univ.)  COMP2023-35 |
In this paper, we consider the volume of the spanning tree polytope and we can compute its volume exactly in polynomi... [more] |
COMP2023-35 pp.42-49 |
| COMP | 2023-03-02 11:30 |
Tokyo | Ochanomizu University | A trial on estimating the volume of n-dimensional polytope using the multivariate Laplace transformation Ei Ando (Senshu Univ.), Christian Engels (NII) COMP2022-34 |
It is often hard to compute the volume of an $n$-dimensional polytope. We consider the volume of the intersection of mul... [more] | COMP2022-34 pp.7-14 |
| COMP | 2021-10-23 16:30 |
Online | Online | Computing the Longest Path Length Distribution Function of DAGs with Small Treewidth and Random Edge Lengths Ei Ando (Senshu Univ.) COMP2021-20 |
Consider the problem of computing the longest path length in directed acyclic graphs (DAGs). It is well known that... [more] |
COMP2021-20 pp.39-46 |
| NLC, IPSJ-NL, SP, IPSJ-SLP (Joint) [detail] |
2017-12-21 12:50 |
Tokyo | Waseda Univ. Green Computing Systems Research Organization | Conversational and Eating Behavior Recognition by Leveraging Throat Sound. Jumpei Ando (Shizuoka Univ.), Takato Saito, Satoshi Kawasaki, Masaji Katagiri, Daizo Ikeda (NTT DOCOMO), Hiroshi Mineno, Tsunakawa Takashi, Masafumi Nishida, Masafumi Nishimura (Shizuoka Univ.) SP2017-60 |
[more] | SP2017-60 pp.23-27 |
| COMP | 2012-03-16 13:00 |
Tokyo | Univ. of Tokyo | Computing the Stochastic Shortest Path Length Between Two Vertices with Exponentially Distributed Edge Lengths in Graphs with Small Treewidth Ei Ando (Sojo Univ.), Joseph Peters (Simon Fraser Univ.) COMP2011-50 |
[more] | COMP2011-50 pp.23-29 |
| MW | 2011-04-15 13:00 |
Miyagi | Tohoku University | Fabrication of 1GS/s Current Mode Pipeline ADC in 90nm CMOS Kei Ando, Takashi Nozawa, Ta Tuan Thanh, Shoichi Tanifuji, Suguru Kameda, Noriharu Suematsu, Tadashi Takagi, Kazuo Tsubouchi (Tohoku Univ.) MW2011-1 |
[more] | MW2011-1 pp.1-6 |
| SR | 2011-01-28 14:15 |
Fukuoka | Kyushu Institute of Technology | 1GS/s Current Mode Pipeline ADC in 90nm CMOS Kei Ando, Takashi Nozawa, Ta Tuan Thanh, Shoichi Tanifuji, Suguru Kameda, Noriharu Suematsu, Tadashi Takagi, Kazuo Tsubouchi (Tohoku Univ.) SR2010-83 |
In heterogeneous wireless network, multimode tranceiver for various wireless system is needed. We have already proposed... [more] |
SR2010-83 pp.89-94 |
| MW | 2010-11-26 13:00 |
Okinawa | Tiruru | A High Efficiency Si-CMOS PA for 60GHz Broadband Communication Employing Optimized Transistor Size Kei Ando, Keisuke Matsuzaki, Katsunori Gomyo, Ta Tuan Thanh, Eita Nakayama, Shoichi Tanifuji, Suguru Kameda, Noriharu Suematsu, Tadashi Takagi, Kazuo Tsubouchi (Tohoku Univ.) MW2010-119 |
[more] | MW2010-119 pp.81-86 |
| COMP | 2007-09-20 13:15 |
Aichi | Approximating the Distribution Function of Minimum Spanning Tree Cost with Normally Disributed Stochastic Edge Weights Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) COMP2007-35 |
Given a graph $G$ of $n$ vertices whose edge weights are random variables and obey mutually independent normal distri... [more] |
COMP2007-35 pp.21-27 |
|
[Return to Top Page]