| 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 | 2018-09-18 15:20 |
Fukuoka | Kyusyu Institute of Technology | Enumeration and Random Sampling of Nonisomorphic Two-Terminal Series-Parallel Graphs Shuhei Denzumi (UTokyo), Takashi Horiyama (Saitama Univ.), Kazuhiro Kurita (Hokudai), Yu Nakahata (NAIST), Hirofumi Suzuki (Hokudai), Kunihiro Wasa (NII), Kazuaki Yamazaki (JAIST)  COMP2018-17 |
A graph $G$ is a two-terminal series-parallel graph if (1) $G$ consists of two vertices and an edge between them or (2) ... [more] | COMP2018-17 pp.55-62 |
| ISEC | 2018-09-07 15:15 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | Consideration of Factorization of a Large Integer using Hensel lifting Kuniaki Tsuji ISEC2018-60 |
RSA cryptography that is used for internet is a typical public key cryptography. The strength of RSA cryptography is gua... [more] | ISEC2018-60 pp.51-55 |
| SIP, EA, SP, MI (Joint) [detail] |
2018-03-20 09:00 |
Okinawa | [Poster Presentation]
Effective Frequency Bands and Features for Epileptic Focus Detectionfrom Interical Electrocorticogram Tatsunori Itakura, Shintaro Ito, Toshihisa Tanaka (TUAT), Hidenori Sugano (Juntendo Univ.) EA2017-159 SIP2017-168 SP2017-142 |
In this paper, we propose fast singular value decomposition (SVD) based on the Chebyshev polynomial approximation (CPA).... [more] | EA2017-159 SIP2017-168 SP2017-142 pp.311-316 |
|
| SIP, EA, SP, MI (Joint) [detail] |
2018-03-20 15:20 |
Okinawa | Fast Singular Value Decomposition Using Polar Decomposition Based on Chebyshev Polynomial Approximation Masaki Onuki, Yuichi Tanaka (TUAT) EA2017-173 SIP2017-182 SP2017-156 |
In this paper, we propose fast singular value decomposition (SVD) based on the Chebyshev polynomial approximation (CPA).... [more] | EA2017-173 SIP2017-182 SP2017-156 pp.391-396 |
|
| ISEC, COMP | 2017-12-21 11:50 |
Kochi | Eikokuji Campus, Kochi University of Technology | Maximum k-path Vertex Cover Problem on Graph Classes Tsuyoshi Yagita, Eiji Miyano, Toshiki Saitoh (Kyutech), Ryuhei Uehara (JAIST), Tom C. van der Zanden (Utrecht U.) ISEC2017-76 COMP2017-30 |
This paper introduces the maximum version of the $k$-path vertex cover problem, called the textsc{Maximum $k$-Path Verte... [more] | ISEC2017-76 COMP2017-30 pp.25-31 |
| ISEC, COMP | 2017-12-21 12:15 |
Kochi | Eikokuji Campus, Kochi University of Technology | An optimal strategy of the second player for the 1-round voronoi game on trees Akihiro Sugimoto (Kobe Univ.), Toshiki Saitoh (Kyushu Inst. of Tech.) ISEC2017-77 COMP2017-31 |
Voronoi game is an encampment game which is played on a plane. The game is expected to be applied to a model of competit... [more] | ISEC2017-77 COMP2017-31 pp.33-39 |
| ISEC, COMP | 2017-12-22 14:40 |
Kochi | Eikokuji Campus, Kochi University of Technology | Efficient Enumeration of Dominating Sets in K-Degenerate graphs Kazuhiro Kurita (HU), Kunihiro Wasa, Takeaki Uno (NII), Hiroki Arimura (HU) ISEC2017-89 COMP2017-43 |
A dominating set is one of the fundamental graph structure, like clique, independent set, s-t path, and cut. It is known... [more] | ISEC2017-89 COMP2017-43 pp.111-117 |
| COMP | 2017-10-27 10:30 |
Tokyo | Subgraph Isomorphism Problem in Polynomial Time Yasunori Ohto COMP2017-20 |
We prove that the NP-complete subgraph isomorphism problem can be solved in polynomial time by using the eigenvalues and... [more] | COMP2017-20 pp.1-4 |
|
| CQ | 2017-07-27 10:50 |
Hyogo | Kobe University | A Matrix Approach to Execute Differential Calculus of Approximated Function Yugo Wakamatsu, Masahiro Hayashi (Tokyo City Univ.) CQ2017-32 |
This paper proposes a new method to approximate the results of differential calculus of a function. If this function (ta... [more] | CQ2017-32 pp.19-24 |
| COMP | 2017-03-07 13:30 |
Aichi | Nanzan University | [Invited Talk]
Beating Brute Force for Systems of Polynomial Equations over Finite Fields Daniel Lokshtanov (U. Bergen), Ramamohan Paturi (UC San Diego), Suguru Tamaki (Kyoto U.), Ryan Williams (MIT), Huacheng Yu (Stanford U.) COMP2016-53 |
Solving systems of multivariate polynomial equations over finite fields is a fundamental problem in mathematics, science... [more] | COMP2016-53 p.19 |
| AP (2nd) |
2017-01-26 - 2017-01-27 |
Overseas | Malaysia-Japan International Institute of Technology (MJIIT) | Approximation of Dielectric Properties Using Polynomial Fit in Microwave Tomography Latifah Mohamed (UniMAP), Ono Yuki, Yoshihiko Kuwahara (Shizuoka Univ.) |
The Finite Difference Time Domain (FDTD) is the most widely used numerical modeling technique to model the propagation o... [more] | |
| MSS, CAS, IPSJ-AL [detail] | 2016-11-25 09:50 |
Hyogo | Kobe Institute of Computing | On the Complexity of Finding a Largest Common Subtree of Trees Hiroki Katsumata, Satoshi Tayu, Shuichi Ueno (Tokyo Tech) CAS2016-70 MSS2016-50 |
The largest common subtree problem (LCST) is to find a tree with the maximum number of edges that is a subtree of all th... [more] | CAS2016-70 MSS2016-50 pp.89-92 |
| COMP, IPSJ-AL | 2016-06-24 13:45 |
Ishikawa | On completeness of polynomial-time counting hierarchy under relaxed subtractive reductions Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2016-7 |
The polynomial-time hierarchy was introduced by Meyer and Stockmeyer, which is a hierarchy on decision problems and has ... [more] | COMP2016-7 pp.9-12 |
|
| COMP, IPSJ-AL | 2016-06-25 13:15 |
Ishikawa | An algorithm for 3-SAT problems Hiroshi Tsukimoto (Tokyo Denki Univ.) COMP2016-10 |
This paper presents an algorithm for 3-SAT problems. First, logical formulas are transformed into elementary algebraic f... [more] | COMP2016-10 pp.89-96 |
|
| COMP, IPSJ-AL | 2016-06-25 15:05 |
Ishikawa | Computational Complexity of Sequential Token Swapping Problem Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takashi Horiyama (Saitama Univ.), Akitoshi Kawamura (Univ. of Tokyo), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (UEC), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2016-13 |
We consider a puzzle consisting of colored tokens on an $n$-vertex graph, where each token has a distinct starting verte... [more] | COMP2016-13 pp.115-121 |
|
| COMP | 2015-12-01 14:20 |
Osaka | [Invited Talk]
Fiding a Stable Allocation in Polymatroid Intersection Satoru Iwata, Yu Yokoi (Univ. Tokyo) COMP2015-34 |
The stable matching model of Gale and Shapley (1962) has been generalized in various directions such as matroid kernels ... [more] | COMP2015-34 p.25 |
|
| NLP | 2015-07-22 10:25 |
Hokkaido | Bibai Onsen Yu-rinkan | A solution on the degree determination problem of Chebyshev polynomials over the residue ring Z/2^kZ Kento Kawano, Daisaburo Yoshioka (Sojo Univ.) NLP2015-77 |
A public key cryptosystem based on Chebyshev polynomials over the residue ring Z/2^k Z is recently introduced. In this p... [more] | NLP2015-77 pp.53-56 |
| IPSJ-CSEC, ISEC, SITE, ICSS, EMM, IPSJ-SPT [detail] | 2015-07-03 11:05 |
Aichi | NAGOYA TRADE & INDUSTRY CENTER | Proposal of Accelerating XL algorithm by Assigning Constants to Variables Masahito Gotaishi, Shigeo Tsujii (Chuo Univ.) ISEC2015-23 SITE2015-21 ICSS2015-33 EMM2015-31 |
The Fixing strategy, which has been long used in XL algorithm is improved so that more variables can be fi xed. This imp... [more] | ISEC2015-23 SITE2015-21 ICSS2015-33 EMM2015-31 pp.137-142 |
| NS, IN (Joint) |
2015-03-02 09:30 |
Okinawa | Okinawa Convention Center | Polynomial-time Algorithm for Traffic Engineering by Link Metric Update Shinya Kurimoto, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2014-185 |
In general, a route determined by an internet routing protocol such as OSPF and BGP is the shortest path that the sum of... [more] | NS2014-185 pp.53-58 |
| COMP | 2014-12-05 13:55 |
Kumamoto | Sojo University | Carry-free positional notation for nonnegative integer combinations of given sets of positive integers satisfying some conditions Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2014-36 |
In this paper, we investigate conditions to compute nonnegative integer combinations for a given set of positive integer... [more] | COMP2014-36 pp.23-27 |
[Return to Top Page]