| 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 # | |
| IT, ISEC, RCC, WBS | 2022-03-11 16:25 |
Online | Online | An Efficient Method for Constructing Garbled Circuits Using Linked Lists Guangjian Liu, Hikaru Morita (Graduate School of Kanagawa Univ)  IT2021-131 ISEC2021-96 WBS2021-99 RCC2021-106 |
Since the proposal of the Garbled Circuit by Yao, a number of construction methods for secret circuits have been propose... [more] | IT2021-131 ISEC2021-96 WBS2021-99 RCC2021-106 pp.281-284 |
| SITE, IA, IPSJ-IOT [detail] | 2021-03-02 13:55 |
Online | Online | Mutual Secrecy of Attributes and Authorization Policies in Identity Federation Satsuki Nishioka, Yasuo Okabe (Kyoto Univ.) SITE2020-53 IA2020-49 |
In modern Web services, authentication federation that separates the Identity Provider (IdP), which centrally manages au... [more] | SITE2020-53 IA2020-49 pp.93-100 |
| QIT (2nd) |
2020-12-10 17:10 |
Online | Online | Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams Seiichiro Tani (NTT) |
An ordered binary decision diagram (OBDD) is a directed acyclic graph that represents a Boolean function. Since OBDDs h... [more] |
|
| VLD, DC, RECONF, ICD, IPSJ-SLDM (Joint) [detail] |
2020-11-17 14:25 |
Online | Online | Variable Ordering for Minimizing Power Consumption of BDD-based Optical Logic Circuits Ryosuke Matsuo, Shin-ichi Minato (Kyoto Univ) VLD2020-24 ICD2020-44 DC2020-44 RECONF2020-43 |
Optical logic circuits based on integrated nanophotonics have attracted significant interest due to their ultra-high-spe... [more] | VLD2020-24 ICD2020-44 DC2020-44 RECONF2020-43 pp.78-83 |
| RECONF | 2020-09-11 15:35 |
Online | Online | Inductive Invariant Generation Based on Binary Decision Diagram and its Application to Logic Synthesis Liu ZiHao, Miyasaka Yukio, Fujita Masahiro (UT) RECONF2020-28 |
In this paper, we mainly focus on inductive invariant generation using binary decision diagram (BDD), and its applicatio... [more] | RECONF2020-28 pp.54-59 |
| R | 2019-11-28 13:45 |
Osaka | Central Electric Club | A Note on Moment-Based Approximation for Uncertainty Propagation in Hierarchical Models Jiahao Zhang (Hiroshima Univ.), Junjun Zheng (Ritsumeikan Univ.), Hiroyuki Okamura, Tadashi Dohi (Hiroshima Univ.) R2019-43 |
This paper discusses an approximation method for uncertainty propagation in a hierarchical model. The uncertainty propag... [more] | R2019-43 pp.1-6 |
| NS | 2019-10-10 16:10 |
Aichi | Nagoya Institute of Technology | [Invited Talk]
On recent developments in network reliability computation using binary decision diagrams Jun Kawahara (Kyoto Univ.) NS2019-113 |
Given a network with static link failure probabilities, the network reliability is to compute the probability that two s... [more] | NS2019-113 pp.59-62 |
| COMP | 2019-09-02 16:00 |
Okayama | Tsushima Campus, Okayama University | Enumeration of Chordal and Interval Subgraphs Using Binary Decision Diagrams Jun Kawahara (NAIST), Toshiki Saitoh (Kyutech), Hirofumi Suzuki (Hokkaido Univ.), Ryo Yoshinaka (Tohoku Univ.) COMP2019-16 |
This research proposes algorithms that construct compressed data structures, called zero-suppressed binary decision dia... [more] |
COMP2019-16 p.33 |
| COMP, IPSJ-AL | 2019-05-11 10:40 |
Kumamoto | Kumamoto University | Enumerating and Indexing Graph Subdivisions using Zero-suppressed Binary Decision Diagrams Yu Nakahata, Jun Kawahara (Kyoto Univ.), Takashi Horiyama (Saitama Univ.), Shin-ichi Minato (Kyoto Univ.) COMP2019-3 |
A subdivision of a graph $H$ is a graph obtained by inserting some vertices into each edge of $H$. In this paper, when ... [more] |
COMP2019-3 pp.51-58 |
| IMQ, IE, MVE, CQ (Joint) [detail] |
2019-03-15 13:50 |
Kagoshima | Kagoshima University | Network reliability evaluation with arbitrary dependencies on link failures Jun Kawahara (NAIST), Takeru Inoue (NTT), Shoji Kasahara (NAIST) CQ2018-113 |
Given a network and the failure ratio of each link of the network, network reliability evaluation is to compute the prob... [more] | CQ2018-113 pp.111-116 |
| IBISML | 2018-11-05 15:10 |
Hokkaido | Hokkaido Citizens Activites Center (Kaderu 2.7) | [Poster Presentation]
A Note on the Estimation Method of Causality Effects based on Statistical Decision Theory Shunsuke Horii, Tota Suko (Waseda Univ.) IBISML2018-97 |
In this paper, we deal with the problem of estimating the intervention effect in statistical causal analysis using struc... [more] | IBISML2018-97 pp.397-402 |
| COMP | 2018-10-26 15:00 |
Kyoto | Kyoto University | Upper and lower bounds on the OBDD-width of a special integer multiplication Tong Qin (Tokyo Tech) COMP2018-27 |
We consider a Boolean function ${rm SMul}_{n-1}^n$ that computes the middle bit of the multiplication of two natural num... [more] | COMP2018-27 pp.45-54 |
| COMP | 2018-10-26 15:55 |
Kyoto | Kyoto University | [Invited Lecture]
Report of Presentation in SEA2018 and Recent Study Yu Nakahata, Jun Kawahara (NAIST) COMP2018-29 |
Partitioning a graph into balanced components is important for several applications. For multi-objective problems, it is... [more] | COMP2018-29 p.57 |
| COMP | 2018-10-26 16:20 |
Kyoto | Kyoto University | [Invited Lecture]
AISTATS2018 Presentation Report and Recent Research Activities Shinsaku Sakaue, Masakazu Ishihata (NTT CS Lab.) COMP2018-30 |
We introduce an AISTATS-2018 accepted paper: Efficient Bandit Combinatorial Optimization Algorithm with Zero-suppressed ... [more] | COMP2018-30 p.59 |
| IBISML | 2017-11-09 13:00 |
Tokyo | Univ. of Tokyo | Fast Computation of Lower Bounds for Privacy Evaluations, Based on Binary Decision Diagrams Shogo Takeuchi (Univ. of Tokyo), Kosuke Kusano, Jun Sakuma (Univ. of Tsukuba), Koji Tsuda (Univ. of Tokyo) IBISML2017-60 |
An input value estimation is a privacy issue in a service provides information by personal information. It is necessary ... [more] | IBISML2017-60 pp.193-200 |
| NC, IPSJ-BIO, IBISML, IPSJ-MPS [detail] | 2017-06-24 09:30 |
Okinawa | Okinawa Institute of Science and Technology | Efficient Adversarial Combinatorial Bandit Algorithm via Zero-suppressed Decision Diagrams Shinsaku Sakaue (NTT), Masakazu Ishihata, Shin-ichi Minato (Hokkaido Univ.) IBISML2017-1 |
We propose an algorithm for the adversarial combinatorial bandit problem, which is a sequential decision problem. The pr... [more] | IBISML2017-1 pp.43-48 |
| VLD | 2017-03-03 11:20 |
Okinawa | Okinawa Seinen Kaikan | Optimization of Parallel Prefix Adder Using Simulated Annealing Takayuki Moto, Mineo Kaneko (JAIST) VLD2016-127 |
In this report, simulated annealing based optimization of parallel prefix adders (PPA) is proposed. In order to construc... [more] | VLD2016-127 pp.139-144 |
| NS, IN (Joint) |
2016-03-04 09:30 |
Miyazaki | Phoenix Seagaia Resort | Evaluating connectivity on physical networks with switch failures Koki Sonoda, Jun Kawahara (NAIST), Takeru Inoue (NTT), Shoji Kasahara (NAIST), Osamu Akashi, Ryoichi Kawahara, Hiroshi Saito (NTT) NS2015-213 |
In a network reliability evaluation, it is a problem to compute the probability that two specified nodes can communicate... [more] | NS2015-213 pp.261-266 |
| COMP | 2015-12-01 10:30 |
Osaka | A Fast Method for Solving Constrained Shortest Path Problems on Directed Acyclic Graphs Fumito Takeuchi (Hokkaido Univ.), Masaaki Nishino (NTT), Norihito Yasuda (Hokkaido Univ.), Takuya Akiba (NII), Shin-ichi Minato (Hokkaido Univ.), Masaaki Nagata (NTT) COMP2015-31 |
This paper deals with shortest path problems on directed acyclic graphs (DAGs), under logical constraints posed between... [more] | COMP2015-31 pp.9-16 |
|
| IN, NV (Joint) |
2015-07-17 11:15 |
Hokkaido | Hokkaido University | [Invited Talk]
Exploiting ZDDs on Constrained Dynamic Programming Problems Norihito Yasuda (Hokkaido Univ.) IN2015-34 |
Dynamic Programming is a fundamental tool for many optimization problems. However, in practical situations, in addition ... [more] | IN2015-34 pp.67-72 |
[Return to Top Page]