Search Results 1-20 of 3201

  • Further Results on Efficient Implementations of Block Cipher Linear Layers

    BANIK Subhadeep , FUNABIKI Yuki , ISOBE Takanori

    … had tweaked the Boyar-Peralta algorithm to get low depth implementations of many matrices. … We show that by introducing randomness in the tweaked algorithm, it is again possible to get low depth implementations with lesser number of gates than the above paper. …

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E104.A(1), 213-225, 2021

    J-STAGE 

  • Sublinear Explicit Incremental Planar Voronoi Diagrams

    Elena Arseneva , John Iacono , Grigorios Koumoutsos , Stefan Langerman , Boris Zolotov

    … A data structure is presented that explicitly maintains the graph of a Voronoi diagram of N point sites in the plane or the dual graph of a convex hull of points in three dimensions while allowing insertions of new sites/points. …

    情報処理学会論文誌 61(12), 2020-12-15

    IPSJ 

  • Efficient Algorithm for 2 × n Map Folding with a Box-pleated Crease Pattern

    Yiyang Jia , Jun Mitani , Ryuhei Uehara

    … Precisely, viewing the crease pattern as a planar graph, its vertices and edges respectively form the subsets of the vertices set and edges set of the planar graph of the square and diagonal grid. … Precisely, viewing the crease pattern as a planar graph, its vertices and edges respectively form the subsets of the vertices set and edges set of the planar graph of the square and diagonal grid. …

    情報処理学会論文誌 61(12), 2020-12-15

    IPSJ 

  • Valid Orderings of Layers When Simple-Folding a Map

    Yiyang Jia , Jun Mitani , Ryuhei Uehara

    … We provide a method and its corresponding linear-time algorithm to solve this problem, which is based on the construction of a directed graph representing the adjacency relations among squares.------------------------------This is a preprint of an article intended for publication Journal ofInformation Processing(JIP). …

    情報処理学会論文誌 61(12), 2020-12-15

    IPSJ 

  • K3 Edge Cover Problem in a Wide Sense

    Kyohei Chiba , Réemy Belmonte , Hiro Ito , Michael Lampis , Atsuki Nagao , Yota Otachi

    … In this study, we consider a problem, for a given graph G = (V, E), of finding the minimum number of 3-cliques (K3s) that cover all edges of G. … Allowing spilling-out is useful for some applications: E.g., when we want to compare n items through some tries of experiments, in which at most three items can be compared simultaneously, and pairs of items that must be compared are given by a graph, finding the minimum number of tries is formalized as this problem. …

    情報処理学会論文誌 61(12), 2020-12-15

    IPSJ 

  • An Algorithm for the Influential Hinge Vertex Problem on Interval Graphs

    Hirotoshi Honma , Yoko Nakajima , Shigeru Masuyama

    … Consider a simple undirected graph G = (V, E) with vertex set V and edge set E. … The influential hinge vertex problem aims to determine the hinge vertex u that maximizesConsider a simple undirected graph G = (V, E) with vertex set V and edge set E. …

    情報処理学会論文誌 61(12), 2020-12-15

    IPSJ 

  • Improved analysis of spectral algorithm for clustering

    Mizutani Tomohiko

    Optimization Letters, 2020-09-08

    IR 

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

    清水 亮太 , 湊 真一

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

    IPSJ 

  • A Method Using a Planar Embeding of a Graph for Placement and Routing Puzzle  [in Japanese]

    甘利 拓斗 , 蓮見 平八郎 , 藤吉 邦洋

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

    IPSJ 

  • A Feasibility Study on Realizing General-purpose Technology Mapper for DSPs of FPGAs Using Exhaustive Search  [in Japanese]

    柴田 晃陽 , 今川 隆司 , 越智 裕之

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

    IPSJ 

  • Fast and Parallel RankClus Algorithm based on Dynamic Rank Score Tracking

    Kotaro Yamazaki , Shohei Matsugu , Hiroaki Shiokawa , Hiroyuki Kitagawa

    Graph clustering is now a fundamental tool to understand overviews from graph-structured data. … The RankClus framework accurately performs clustering for bi-type information networks using ranking-based graph clustering techniques. … It integrates graph ranking algorithms such as PageRank or HITS into graph clustering procedures to improve the clustering quality. …

    情報処理学会論文誌データベース(TOD) 13(3), 2020-07-16

    IPSJ 

  • Estimating High Betweenness Centrality Nodes via Random walk in Social Networks

    Kazuki Nakajima , Kazuyuki Shudo

    … Several algorithms have been studied to efficiently compute the top-k nodes with the highest betweenness centrality on a graph where all the data is available. … However, all the graph data of real social networks are not typically available to third parties such as researchers or marketers, and hence, an estimation algorithm based on sampling the graph data is required. …

    情報処理学会論文誌データベース(TOD) 13(3), 2020-07-16

    IPSJ 

  • Tree Decomposition-based Approach for Compiling Independent Sets

    Teruji Sugaya , Masaaki Nishino , Norihito Yasuda , Shin-ichi Minato

    Graph substructure plays an important role in knowledge compilation and frontier-based search is known to be an efficient algorithm, in which computation time is bounded by the path-width of a graph. … For some limited classes of graph structures, studies have shown that it can be improved and bounded by the branch-width, however, the redesign of an algorithm for other classes does not appear to be straightforward. …

    情報処理学会論文誌 61(7), 2020-07-15

    IPSJ 

  • 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. … It is proved to work in O(3n/3)-time in the worst-case for an n vertex graph. …

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

    IR 

  • Analysis and Annotation of Emotional Traits on Audio Conversations in Real-time

    Han Di

    … For better visualization, a Graphical User Interface is made to display the waveform graph, spectrogram graph and speech emotion prediction graph of a given speech audio. … Meanwhile, the effect of voice activity detection algorithm is analyzed in this study. …

    法政大学大学院紀要. 情報科学研究科編 (15), 1-6, 2020-03-24

    IR  DOI 

  • A New Mutant Generation Algorithm based on Path Coverage for Mutant Reduction

    Xu Qin

    … In our research, we present a new mutant generation algorithm based on the basic path coverage to reduce mutants. … The algorithm is characterized by implementing a basic path segment identification criterion for determining appropriate program points at which faults are inserted and a mutant generation priority criterion for selecting proper mutant operators to make a fault for insertion. …

    法政大学大学院紀要. 情報科学研究科編 (15), 1-6, 2020-03-24

    IR  DOI 

  • Integrated Factor Graph Algorithm for DOA-based Geolocation and Tracking

    Cheng Meng , Aziz Muhammad Reza Kahar , Matsumoto Tad

    … This paper proposes a new position tracking algorithm by integrating extended Kalman filter (EKF) and direction-of-arrival (DOA)-based geolocation into one factor graph (FG) framework. …

    IEEE Access (8), 49989-49998, 2020-03-09

    IR 

  • Multi-scale Graph Construction Method for Graph Signal Coding with SPIHT Algorithm  [in Japanese]

    阿部 幸輔 , 田中 雄一

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 119(440), 289-294, 2020-03-02

  • Multi-scale Graph Construction Method for Graph Signal Coding with SPIHT Algorithm  [in Japanese]

    阿部 幸輔 , 田中 雄一

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報 119(439), 289-294, 2020-03-02

  • An Algorithm for AED Location Problem on a Graph Model  [in Japanese]

    毛利 進太郎 , Tseng Ya-fen , 石井 博昭

    神戸学院経済学論集 = Kobe Gakuin economic papers 51(4), 101-112, 2020-03

Page Top