| 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 # | |
| LOIS, SITE, ISEC | 2023-11-09 12:40 |
Hiroshima | Satellite Campus Hiroshima (Hiroshima, Online) (Primary: On-site, Secondary: Online) |
Private-preserving encoding and decoding using variable-length coding schemes Yuki Seto, Kunihiko Sadakane, Kazunari Tozawa (UTokyo)  ISEC2023-55 SITE2023-49 LOIS2023-13 |
Variable-length segmented bit-vectors are commonly used in variable-length coding schemes and the construction of succin... [more] | ISEC2023-55 SITE2023-49 LOIS2023-13 pp.2-9 |
| IT | 2019-11-26 15:10 |
Kagoshima | Kirishima Kokusai Hotel (Kagoshima) | [Invited Talk]
Succinct Data Structures and Information Theory Kunihiko Sadakane (UTokyo) IT2019-33 |
Succinct data structures can compress data into their entropy and support efficient queries. In this paper, we explain ... [more] | IT2019-33 pp.7-14 |
| COMP | 2019-03-18 09:30 |
Tokyo | The University of Tokyo (Tokyo) | Range Mode Query and Solution Enumeration Kentaro Sumigawa, Kunihiko Sadakane (Univ. of Tokyo) COMP2018-43 |
The range mode query problem is constructing a data structure from the given array of $n$ terms which can efficiently an... [more] | COMP2018-43 pp.1-8 |
| COMP | 2019-03-18 11:10 |
Tokyo | The University of Tokyo (Tokyo) | A GPU-based Non-commutative Reduction and Its Applications to Operations for Difference Arrays Atsushi Koike (NIT Ichinoseki), Kunihiko Sadakane (UTokyo) COMP2018-47 |
Reduction is basic operation in parallel computing.It is generalization of summation, in which we can use any associativ... [more] | COMP2018-47 pp.33-40 |
| COMP | 2018-03-05 15:30 |
Osaka | Osaka Prefecture Univ. (Osaka) | Efficient Computation of Betweenness Centrality by Graph Decompositions and their Applications to Real-world Networks Tatsuya Inoha (Osaka Pref. Univ.), Kunihiko Sadakane (Univ. of Tokyo), Yushi Uno (Osaka Pref. Univ.), Yuuma Yonebayashi (Univ. of Tokyo) COMP2017-51 |
Betweenness centrality is one of the most significant and commonly used centralities which is a notion of measuring the ... [more] | COMP2017-51 pp.35-42 |
| COMP, ISEC | 2016-12-22 10:30 |
Hiroshima | Hiroshima University (Hiroshima) | [Invited Talk]
Theory and Practice of Succinct Data Structures Kunihiko Sadakane (Univ. of Tokyo) ISEC2016-82 COMP2016-43 |
Succinct data structures are data structures that can compress data to the limit and perform search and other operations... [more] | ISEC2016-82 COMP2016-43 p.71 |
| COMP | 2015-04-23 15:25 |
Miyagi | (Miyagi) | Computational Complexity of Generalized Makespan Minimization Problem Tsunehiko Nagayama, Kunihiko Sadakane (Univ. of Tokyo) COMP2015-4 |
We generalize the makespan minimization problem on unrelated parallel machines and formulate the generalized makespan mi... [more] | COMP2015-4 pp.21-25 |
| COMP, IPSJ-AL | 2013-05-17 16:05 |
Hokkaido | Otaru University of Commerce (Hokkaido) | On Complexities of Parallel Sort Algorithms on AGPU model Atsushi Koike, Kunihiko Sadakane, Hoa Vu (NII) COMP2013-13 |
This paper is concerned with complexities of parallel sorting algorithms on AGPU model. First, we analyze known sort al... [more] |
COMP2013-13 pp.75-80 |
| COMP | 2013-03-18 13:45 |
Gifu | Gifu University (Gifu) | Compact and Fast Indices Based on Zero-Suppressed Binary Decision Diagrams Shuhei Denzumi (Hokkaido Univ.), Jun Kawahara (NAIST), Koji Tsuda (AIST/JST), Hiroki Arimura (Hokkaido Univ.), Shin-ichi Minato (Hokkaido Univ./JST), Kunihiko Sadakane (NII) COMP2012-56 |
In many real-life problems, we are often faced with manipulating families of sets. Manipulation of large-scale set famil... [more] | COMP2012-56 pp.23-30 |
| COMP | 2012-10-31 16:45 |
Miyagi | Tohoku University (Miyagi) | A Novel Computation Model for GPU Atsushi Koike, Kunihiko Sadakane (NII) COMP2012-42 |
We propose a novel computation model for GPU. Known parallel computation models such as the PRAM model are not appropria... [more] | COMP2012-42 pp.53-60 |
| COMP | 2012-09-03 11:25 |
Tokyo | Hosei University (Tokyo) | Compressing de Bruijn Graphs Alexander Bowe (NII), Taku Onodera (Univ. of Tokyo), Kunihiko Sadakane (NII), Tetsuo Shibuya (Univ. of Tokyo) COMP2012-29 |
We propose a new succinct de Bruijn graph representation. If the de Bruijn graph of $k$-mers in a DNA sequence of len... [more] |
COMP2012-29 pp.25-32 |
| COMP | 2012-03-16 10:35 |
Tokyo | Univ. of Tokyo (Tokyo) | A simple parallel computation algorithm for functions on trees Kunihiko Sadakane (NII) COMP2011-48 |
We propose a simple parallel algorithm for computing a function defined on a rooted tree with $n$ nodes. Namely, we w... [more] |
COMP2011-48 pp.9-15 |
| COMP | 2011-10-21 15:50 |
Miyagi | Tohoku Univ. (Miyagi) | Memory Compression Wing-Kin Sung (NUS), Kunihiko Sadakane (NII), Jesper Jansson (Ochanomizu U.) COMP2011-34 |
This paper proposes a new dynamic data-structure for \emph{compressed random access memory}. A memory (or string) $T[1... [more] |
COMP2011-34 pp.39-46 |
| COMP | 2011-04-22 15:50 |
Kyoto | Kyoto University (Kyoto) | Online Prediction on Labeled Graphs Koji Kobayashi, Kunihiko Sadakane (NII) COMP2011-9 |
[more] | COMP2011-9 pp.61-68 |
| COMP | 2009-05-26 10:05 |
Saitama | Saitama Univ. (Saitama) | A Tight Upper Bound on the Hitting and the Cover times of Metropolis Walks Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ) COMP2009-10 |
andom walks on finite graphs are random token circulation on graphs. Random walks such that token moves to adjacent vert... [more] | COMP2009-10 pp.9-12 |
| COMP | 2009-04-17 14:40 |
Kyoto | Kyoto Univ. (Kyoto) | Dynamic Succinct Ordinal Trees Kunihiko Sadakane (Kyushu Univ.) COMP2009-6 |
This paper proposes succinct data structures for dynamic ordinal trees. Succinct data structures are the ones whose siz... [more] |
COMP2009-6 pp.37-41 |
| COMP | 2008-10-10 11:15 |
Miyagi | Tohoku Univ. (Miyagi) | A Simple Succinct Representation of Balanced Parentheses Sequences Kunihiko Sadakane (Kyushu U) COMP2008-38 |
The balanced parentheses sequence (BP) is a representation of ordinal trees which was extensively studied recently. An... [more] |
COMP2008-38 pp.33-40 |
| COMP | 2008-05-13 14:30 |
Fukuoka | Kyushu Sangyo University (Fukuoka) | On Necessary Conditions of Linear Cover Time Random Walks Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyusyu Univ) COMP2008-12 |
A random walk on a finite graph is a model that a token on a vertex repeatedly moves to an adjacent vertex randomly chos... [more] | COMP2008-12 pp.33-36 |
| COMP | 2008-03-10 11:50 |
Kanagawa | (Kanagawa) | Compressed Full-text Indexes for DNA Sequences Kunihiko Sadakane (Kyushu U.) COMP2007-60 |
A problem of processing large-scale data is the amount of space to store data and the size of data structures for effic... [more] |
COMP2007-60 pp.33-37 |
| COMP | 2007-09-20 13:15 |
Aichi | (Aichi) | Approximating the Distribution Function of Minimum Spanning Tree Cost with Normally Disributed Stochastic Edge Weights Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) COMP2007-35 |
Given a graph $G$ of $n$ vertices whose edge weights are random variables and obey mutually independent normal distri... [more] |
COMP2007-35 pp.21-27 |
[Return to Top Page]