Search Results 1-20 of 379

  • Exploring Minimum Pass Transistor Circuits Based on Exhaustive Enumeration  [in Japanese]

    清水 亮太 , 湊 真一

    DAシンポジウム2020論文集 (2020), 156-162, 2020-08-31

    IPSJ 

  • Compression by Substring Enumeration Using Sorted Contingency Tables

    Takahiro OTA , Hiroyoshi MORITA , Akiko MANADA

    … This paper proposes two variants of improved Compression by Substring Enumeration (CSE) with a finite alphabet. … Therefore, we derive a new tight lower bound based on the contingency table and consequently propose a new CSE algorithm using the new inequality. … We then propose a new CSE algorithm which is the first proposed CSE algorithm using the new encoding order. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E103.A(6), 829-835, 2020-06-01

    IR 

  • Another Time-Complexity Analysis for Maximal Clique Enumeration Algorithm CLIQUES

    Etsuji TOMITA , Alessio CONTE

    … We revisit the maximal clique enumeration algorithm CLIQUES that appeared in Theoretical Computer Science 2006. …

    IEICE Technical Report (COMP2020-1(2020-05)), 1-8, 2020-05

    IR 

  • Proposal of Extraction Method of Important Features in Surgical Planning for Mandibular Reconstruction  [in Japanese]

    永井 一希 , 中尾 恵 , 上田 順宏 , 今井 裕一郎 , 桐田 忠昭 , 松田 哲也

    … We propose an extraction algorithm of low dimensional features which are important for determining the number of fibular segments in mandibular reconstruction by enumeration of Lasso solutions. … To perform multi-class classification, we extend enumeration of Lasso solutions by using the evaluation function that indexes the contribution of the extracted features. …

    電子情報通信学会技術報告 (MI) 119(399), 23-28, 2020-01-22

    IR 

  • Using SubSieve Technique to Accelerate TupleSieve Algorithm

    SUN Zedong , GU Chunxiang , ZHENG Yonghui

    … <p>Sieve algorithms are regarded as the best algorithms to solve the shortest vector problem (SVP) on account of its good asymptotical quality, which could make it outperform enumeration algorithms in solving SVP of high dimension. … To overcome this bottleneck, TupleSieve algorithm was proposed to reduce memory consumption by a trade-off between time and memory. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2020

    J-STAGE 

  • Fairwashing: the risk of rationalization  [in Japanese]

    ARAI Hiromi , AÏVODJI Urlich , FORTINEAU Olivier , GAMBS Sébastien , HARA Satoshi , TAPP Alain

    … Our solution, LaundryML, is based on a regularized rule list enumeration algorithm whose objective is to search for fair rule lists approximating an unfair black-box model. …

    Proceedings of the Annual Conference of JSAI JSAI2020(0), 3N5OS11b04-3N5OS11b04, 2020

    J-STAGE 

  • Construction of BDD for Indexing Vertex Separators between All Vertex Pairs of Graphs  [in Japanese]

    TAKAHASHI Masahiro , KAWAHARA Jun , MINATO Shin-ichi

    … In this article, we propose an algorithm that, when an undirected graph is given as input, indexes all vertex separators of all vertex pairs in a form that can be easily used later. … Then by using a data structure called BDD for indexing, we aim for an efficient algorithm. … In the experiments, the proposed algorithm was applied to square lattice graphs, which are graphs with a regular structure, and randomly generated graphs. …

    Proceedings of the Annual Conference of JSAI JSAI2020(0), 2N5OS17b03-2N5OS17b03, 2020

    J-STAGE 

  • Compression by Substring Enumeration Using Sorted Contingency Tables

    OTA Takahiro , MORITA Hiroyoshi , MANADA Akiko

    … <p>This paper proposes two variants of improved Compression by Substring Enumeration (CSE) with a finite alphabet. … Therefore, we derive a new tight lower bound based on the contingency table and consequently propose a new CSE algorithm using the new inequality. … We then propose a new CSE algorithm which is the first proposed CSE algorithm using the new encoding order. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E103.A(6), 829-835, 2020

    J-STAGE 

  • Enumeration of Maximally Frequent Ordered Tree Patterns with Height-constrained Variables for Trees

    Yusuke Suzuki , Tetsuhiro Miyahara , Takayoshi Shoudai , Tomoyuki Uchida , Satoshi Matsumoto , Tetsuji Kuboyama

    … Then, we present an algorithm for enumerating all maximally frequent height-constrained ordered tag tree patterns. … Then, we present an algorithm for enumerating all maximally frequent height-constrained ordered tag tree patterns. …

    情報処理学会論文誌数理モデル化と応用(TOM) 12(3), 78-88, 2019-12-23

    IPSJ 

  • A Versatile Algorithm for Enumerating All Spanning Trees Based on Prufer Sequence  [in Japanese]

    片岡 靖詞

    防衛大学校理工学研究報告 = Scientific and engineering reports of the National Defense Academy 56(2), 1-10, 2019-03

    IR 

  • LINK-BASED APPROACH FOR SEMI-DYNAMIC STOCHASTIC USER EQUILIBRIUM TRAFFIC ASSIGNMENT WITH SENSITIVITY ANALYSIS MODEL

    BUI Tien Thiem , NAKAYAMA Shoichiro , YAMAGUCHI Hiromichi , KOIKE Kosuke

    … However, because of route enumeration in the sensitivity analysis formulations, applying the proposed method to very large-scale network has been in difficulty. … This method is developed from STOCH3 algorithm and Depth First Search (DFS) algorithm. …

    Journal of Japan Society of Civil Engineers, Ser. D3 (Infrastructure Planning and Management) 75(5), I_615-I_625, 2019

    J-STAGE 

  • Energy Minimization over <i>m</i>-Branched Enumeration for Generalized Linear Subspace Clustering

    ZHANG Chao

    … To settle this problem, we take advantages of both greedy strategy and energy minimization strategy to propose a simple yet effective algorithm based on the assumption that an <i>m</i>-branched (i.e., perfect <i>m</i>-ary) tree which is constructed by collecting <i>m</i>-nearest neighbor points in each node has a high probability of containing the near-exact subspace. …

    IEICE Transactions on Information and Systems E102.D(12), 2485-2492, 2019

    J-STAGE 

  • An Efficient Parallel Triangle Enumeration on the MapReduce Framework

    KIM Hongyeon , MIN Jun-Ki

    … Furthermore, to enhance the performance of our algorithm, we remove the duplicated wedges existing in several groups. … Our experimental evaluation shows the performance of our proposed algorithm is better than that of the state-of-the-art algorithm in diverse environments.</p> …

    IEICE Transactions on Information and Systems E102.D(10), 1902-1915, 2019

    J-STAGE 

  • Efficient Approximate 3-Dimensional Point Set Matching Using Root-Mean-Square Deviation Score

    SASAKI Yoichi , SHIBUYA Tetsuo , ITO Kimihito , ARIMURA Hiroki

    … First, we present an efficient branch-and-bound algorithm using a novel lower bound function of the minimum RMSD score for the enumeration version of APSM problem. … Then, we modify this algorithm for the optimization version. … Next, we present another algorithm that runs fast with high probability when a set of parameters are fixed. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E102.A(9), 1159-1170, 2019

    J-STAGE 

  • Enumerating Highly-Edge-Connected Spanning Subgraphs

    YAMANAKA Katsuhisa , MATSUI Yasuko , NAKANO Shin-ichi

    … We first present an algorithm that enumerates all the 2-edge-connected spanning subgraphs of a given plane graph with <i>n</i> … The algorithm generates each 2-edge-connected spanning subgraph of the input graph in O(<i>n</i>) time. … We next present an algorithm that enumerates all the <i>k</i>-edge-connected spanning subgraphs of a given general graph with <i>m</i> …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E102.A(9), 1002-1006, 2019

    J-STAGE 

  • Sparse Bayesian Learning for Itemset Data  [in Japanese]

    YAFUNE Ryoichiro , SAIGO Hiroto

    … We propose an iterative algorithm that can efficiently extract non-linear features while avoiding the entire enumeration. …

    Proceedings of the Annual Conference of JSAI JSAI2019(0), 1J3J204-1J3J204, 2019

    J-STAGE 

  • An efficient branch and bound algorithm for direct model predictive control of boost converter

    Amir Rizwan , Ali Nouman , Hasan Ammar

    … <p>The algorithmic efficiency offered by sphere decoding when compared with enumeration technique makes it a better choice for direct model predictive control of power converters. … However, the application of sphere decoding algorithm requires that the converter's model should have the same state transition and input matrices irrespective of switch position and continuous/discontinuous conduction mode. …

    IEICE Electronics Express 16(5), 20180445-20180445, 2019

    J-STAGE 

  • Efficient Enumeration of Flat-Foldable Single Vertex Crease Patterns

    OUCHI Koji , UEHARA Ryuhei

    … <p>We investigate enumeration of distinct flat-foldable crease patterns under the following assumptions: positive integer <i>n</i> … In this study, we develop the first algorithm for the above stated problem by combining these results in a nontrivial way and show its analysis of efficiency.</p> …

    IEICE Transactions on Information and Systems E102.D(3), 416-422, 2019

    IR  J-STAGE 

  • A Universal Two-Dimensional Source Coding by Means of Subblock Enumeration

    OTA Takahiro , MORITA Hiroyoshi , MANADA Akiko

    … <p>The technique of lossless compression via substring enumeration (CSE) is a kind of enumerative code and uses a probabilistic model built from the circular string of an input source for encoding a one-dimensional (1D) source. … The proposed algorithm uses the flat torus of an input 2D source as a probabilistic model instead of the circular string of the source. … Moreover, we prove the asymptotic optimality of the proposed algorithm for 2D general sources.</p> …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E102.A(2), 440-449, 2019

    IR  J-STAGE 

  • Efficient Enumeration Algorithm for Dominating Sets in Bounded Degenerate Graphs (Foundations and Applications of Algorithms and Computation)

    Kurita Kazuhiro , Wasa Kunihiro , Arimura Hiroki , Uno Takeaki

    … However, enumeration of dominating sets has not received much attention. … This study aims to propose an efficient enumeration algorithms for bounded degenerate graphs. … The algorithm enumerates all the dominating sets for k-degenerate graphs in O(k) time per solution using O(n+m) space. … Since planar graphs have a constant degeneracy, this algorithm can enumerate all such sets for planar graphs in constant time per solution. …

    数理解析研究所講究録 (2088), 44-52, 2018-08

    IR 

Page Top