| 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 # | |
| QIT (2nd) |
2023-12-17 17:30 |
Okinawa | OIST (Primary: On-site, Secondary: Online) |
How to Map Linear Differential Equations to Schr"{o}dinger Equations via Carleman and Koopman-von Neumann Embeddings for Quantum Algorithms Yuki Ito (Osaka Univ.), Yu Tanaka (Sony Group), Keisuke Fujii (Osaka Univ./RIKEN) |
Solving differential equations with large degrees of freedom is an important task for scientific and industrial applicat... [more] | |
| WIT, SP, IPSJ-SLP [detail] | 2023-10-14 16:15 |
Fukuoka | Kyushu Institute of Technology (Primary: On-site, Secondary: Online) |
Comparative study on different speaker embedding spaces focusing on the relation to perceptual inter-speaker similarity Wakuto Morita, Daisuke Saito, Nobuaki Minematsu (Univ. of Tokyo)  SP2023-31 WIT2023-22 |
This study examines the correspondence between inter-speaker similarity based on speaker embeddings and perceptual speak... [more] | SP2023-31 WIT2023-22 pp.21-26 |
| EA, US, SP, SIP, IPSJ-SLP [detail] | 2021-03-03 17:10 |
Online | Online | An investigation of rhythm-based speaker embeddings for phoneme duration modeling Kenichi Fujita, Atsushi Ando, Yusuke Ijima (NTT) EA2020-77 SIP2020-108 SP2020-42 |
In this study, we propose a speaker embedding method suitable for modeling phoneme duration length for each individual i... [more] | EA2020-77 SIP2020-108 SP2020-42 pp.103-108 |
| IBISML | 2020-03-11 09:20 |
Kyoto | Kyoto University (Cancelled but technical report was issued) |
Subspace Representation for Graphs Junki Ishikawa, Hiroaki Shiokawa, Kazuhiro Fukui (Tsukuba Univ.) IBISML2019-40 |
In this research, we discuss a representation learning for graph analysis, where a graph is represented by a low dimensi... [more] | IBISML2019-40 pp.51-57 |
| NLC, IPSJ-DC | 2019-09-28 17:55 |
Tokyo | Future Corporation | On evaluation of word-embedding models for technical term in space systems Naoko Okubo, Sho Kurahayashi, Kenji Mori, Kohsuke Namihira, Yasushi Ueda, Masafumi Katahira (JAXA), Toshiyuki Amagasa (Unv. Tsukuba) NLC2019-28 |
In this paper, we report the examination result of the method to evaluate the quality of the word-em-bedding models with... [more] | NLC2019-28 pp.109-114 |
| MW, WPT | 2018-04-27 14:50 |
Tokyo | Kikai-Shinko-Kaikan Building | S-band Tx Module with Cu Pillar Interconnection Si/GaN 3D Chip Embedding Substrate Kengo Kawasaki, Eigo Kuwata, Hidenori Ishibashi, Tomohiro Yao, Kiyoshi Ishida, Kazuhiro Maeda, Hironobu Shibata, Masaomi Tsuru, Kazutomi Mori, Mitsuhiro Shimozawa, Hiroshi Fukumoto (Mitsubishi Electric Corp.) WPT2018-5 MW2018-5 |
A SiGe chip and GaN chip packaged Tx module in S-band is represented. SiGe and GaN with Redistribution Layer (RDL) are i... [more] | WPT2018-5 MW2018-5 pp.19-23 |
| ICSS | 2015-03-04 09:00 |
Okinawa | Meio Univiersity | A New Explicit Relation Between Trace, Definition Field, and Embedding Degree Atsuko Miyaji, Satoru Tanaka (JAIST) ICSS2014-76 |
For pairing based cryptography, elliptic curves defined over a finite fields $mathbb{F}_p^m$ with moderate embedding deg... [more] | ICSS2014-76 pp.79-84 |
| ISEC, LOIS | 2012-11-22 14:45 |
Shizuoka | Shizuoka City Industry-University Exchange Center | A New Explicit Relation between Trace, Definition Field, and Embedding Degree Atsuko Miyaji, Xiaonan Shi (JAIST) ISEC2012-69 LOIS2012-44 |
For pairing based cryptography we need elliptic curves de fined over extension nite elds Fpm with moderate embedding ... [more] |
ISEC2012-69 LOIS2012-44 pp.83-88 |
| ISEC, LOIS | 2011-11-15 14:50 |
Osaka | Osaka Electro-Communication University | On Definition Fields of Pairing Friendly Curves With Embedding Degree 4, 6, 8 Masaaki Shirase (FUN) ISEC2011-58 LOIS2011-52 |
The BN prime $p$, which is required for constructing the BN curve, is given by $p=36z^4+36z^3+24z^2+6z+1$. By the way, t... [more] | ISEC2011-58 LOIS2011-52 pp.163-170 |
| ISEC | 2009-12-16 15:20 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | GLV Method for Non-Supersingular Paring-Friendly Curves of Embedding Degree 1 Shoichi Takeuchi, Tetsuya Izuta, Yumi Sakemi, Kazushi Nishii, Yasuyuki Nogami, Yoshitaka Morikawa (Okayama Univ.) ISEC2009-76 |
Recently, some pairing-based cryptographies that uses a non-supersingular pairing-friendly curve whose order has large p... [more] | ISEC2009-76 pp.37-41 |
| ISEC | 2009-09-25 15:20 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | An Implementation of Tate Pairing with Non-Supersingular Curves of Embedding degree 1 Tetsuya Izuta, Yumi Sakemi, Kazushi Nishii, Shoichi Takeuchi, Yasuyuki Nogami, Yoshitaka Morikawa (Okayama Univ.) ISEC2009-48 |
Recently, pairing-based cryptographic applications such as ID-based cryptography have received much attention. On the ot... [more] | ISEC2009-48 pp.59-64 |
| WBS, IT, ISEC | 2009-03-10 09:25 |
Hokkaido | Hakodate Mirai Univ. | Elliptic curves with a pre-determined embedding degree Shoujirou Hirasawa, Atsuko Miyaji (JAIST) IT2008-79 ISEC2008-137 WBS2008-92 |
A paring over an elliptic-curve E(F_{p^m}) to an extension field of F_{p^{mk}} has begun to be attractive to cryptosyste... [more] | IT2008-79 ISEC2008-137 WBS2008-92 pp.223-229 |
| ISEC, LOIS | 2008-11-14 09:30 |
Aichi | Nagoya Noh Theater | Elliptic curves with a pre-determined embedding degree. Shoujirou Hirasawa, Atsuko Miyaji (Japan Advanced Instisute of Science and Technology) ISEC2008-82 OIS2008-58 |
Embedding degree k is one indicator to the difference between on the elliptic curve discrete logarithm problem (ECDLP) a... [more] | ISEC2008-82 OIS2008-58 pp.63-66 |
| CAS, MSS | 2008-11-06 10:20 |
Osaka | Osaka University | Separator-Based Graph Embedding into Higher-Dimensional Grids with Small Congestion Akira Matsubayashi (Kanazawa Univ.) CAS2008-47 CST2008-25 |
We study the problem of embedding a guest graph with minimum edge-congestion into a high dimensional grid of the same si... [more] | CAS2008-47 CST2008-25 pp.11-16 |
| COMP | 2006-05-24 13:00 |
Fukuoka | Kyushu Institute of Technology | Approximating Tree Edit Distance Through String Edit Distance Tatsuya Akutsu (Kyoto Univ.), Daiji Fukagawa, Atsuhiro Takasu (NII) |
We present a method to transform an ordered and rooted tree of bounded degree into a string, where it is done by computi... [more] | COMP2006-12 pp.17-24 |
| CAS | 2005-01-19 11:35 |
Ishikawa | Kanazawa Univ | Small Congestion Embedding of Separable Graphs into Grids of the Same Size Akira Matsubayashi (Kanazawa Univ.) |
In this paper we consider the problem of embedding a (guest) graph into a grid with the same number of nodes as those of... [more] | CAS2004-63 pp.19-24 |
| COMP | 2004-06-25 15:20 |
Kanagawa | NTT CSLab Atsugi | Embedding bipartite graphs into book space Miki Miyauchi (NTT) |
This paper studies the problem of book-embeddings of bipartite graphs. When each edge is allowed to appear in one or mor... [more] | COMP2004-24 pp.41-45 |
[Return to Top Page]