IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 33  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
IT 2019-11-26
Kagoshima Kirishima Kokusai Hotel [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
COMP 2019-03-18
Tokyo The University of 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
COMP 2019-03-18
Tokyo The University of 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
COMP 2018-03-05
Osaka Osaka Prefecture Univ. 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
COMP, ISEC 2016-12-22
Hiroshima Hiroshima University [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
COMP 2015-04-23
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
COMP, IPSJ-AL 2013-05-17
Hokkaido Otaru University of Commerce 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]
COMP 2013-03-18
Gifu Gifu University 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
COMP 2012-10-31
Miyagi Tohoku University 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
COMP 2012-09-03
Tokyo Hosei University 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]
COMP 2012-03-16
Tokyo Univ. of 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]
COMP 2011-10-21
Miyagi Tohoku Univ. 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]
COMP 2011-04-22
Kyoto Kyoto University Online Prediction on Labeled Graphs
Koji Kobayashi, Kunihiko Sadakane (NII) COMP2011-9
 [more] COMP2011-9
COMP 2009-05-26
Saitama Saitama Univ. 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
COMP 2009-04-17
Kyoto Kyoto Univ. 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]
COMP 2008-10-10
Miyagi Tohoku Univ. 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]
COMP 2008-05-13
Fukuoka Kyushu Sangyo University 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
COMP 2008-03-10
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]
COMP 2007-09-20
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]
COMP 2007-05-25
Fukuoka Kyushu University Optimality and Algorithms for the Balanced Edge Cover Problem
Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) COMP2007-17
For an undirected graph $G = (V, E)$, an edge cover is defined as a set of edges that covers all vertices of $V$. It is... [more] COMP2007-17
 Results 1 - 20 of 33  /  [Next]  
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan