| 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 (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 | [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, ISEC | 2016-12-22 10:30 |
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 p.71 |
| RECONF | 2016-05-19 10:05 |
Kanagawa | FUJITSU LAB. | Succinct-Data-Structure Based on Block-Size-Constrained Compression for a Text-Search Accelerator Masanori Hariyama, Hasitha Muthumala Waidyasooriya (Tohoku Univ.) RECONF2016-2 |
Succinct data structures are introduced to efficiently solve a given problem while representing the data using as a litt... [more] | RECONF2016-2 pp.3-8 |
| COMP | 2012-09-03 11:25 |
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] |
COMP2012-29 pp.25-32 |
| IBISML | 2010-06-14 14:30 |
Tokyo | Takeda Hall, Univ. Tokyo | [Invited Talk]
Large-Scale String Processing: Theory and Practice Daisuke Okanohara (Preferred Infrastructure Icn.) IBISML2010-5 |
String data is used in many fields including natural language processing, genome analysis and log analysis. The sizes of... [more] | IBISML2010-5 pp.15-22 |
| COMP | 2009-04-17 14:40 |
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] |
COMP2009-6 pp.37-41 |
| COMP | 2008-10-10 11:15 |
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] |
COMP2008-38 pp.33-40 |
| COMP | 2008-03-10 11:50 |
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 | 2006-09-26 15:40 |
Ishikawa | JAIST | A New Representation of Ordered Trees Jesper Jansson, Kunihiko Sadakane (Kyushu Univ.), Wing-Kin Sung (NUS) |
There exist two well-known succinct representations of ordered trees: BP (balanced parenthesis) [Munro, Raman 2001] and... [more] |
COMP2006-29 pp.31-37 |
| COMP | 2006-06-23 15:00 |
Saitama | Saitama Univ. | Simple Rank/Select Dictionaries Kunihiko Sadakane (Kyushu U) |
Rank/Select directories are data structures to compute,for an ordered set S ⊂{0 , 1 ,...,m −1 }, rank x, S = |{y ... [more] |
COMP2006-23 pp.43-48 |
| COMP | 2005-10-18 15:05 |
Miyagi | Tohoku Univ. | Compressing Compressed Data Structures Kunihiko Sadakane (Kyushu Univ.), Roberto Grossi (Pisa Univ.) |
Succinct data structures are the ones which are compressed into nearly the information-theoretic lower bound while supp... [more] |
COMP2005-41 pp.37-44 |
[Return to Top Page]