| 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 |
| COMP | 2022-12-06 11:25 |
Ehime | Ehime Univ. Media Hall | Efficient Computation of the Run-length Encoded Burrows-Wheeler Transform Based on the Compact Directed Acyclic Word Graph Mizuki Sue, Yasuaki Kobayashi, Hiroki Arimura (Hokkaido Univ.), Yuto Nakashima, Shunsuke Inenaga (Kyushu Univ.) COMP2022-25 |
(To be available after the conference date) [more] | COMP2022-25 pp.21-28 |
| ET | 2020-03-07 10:10 |
Kagawa | National Institute of Technology, Kagawa Collage (Cancelled but technical report was issued) |
A Program Visualization System that Considers the Design Patterns Forming Data Structure Masanori Ohshiro, Yasuo Nagai (TUIS) ET2019-96 |
As a basis of class design utilizing object orientation, methods of forming data structures such as a list structure and... [more] | ET2019-96 pp.115-119 |
| 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 | 2019-03-18 09:30 |
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 pp.1-8 |
| IN, NS (Joint) |
2019-03-04 09:00 |
Okinawa | Okinawa Convention Center | The Development of Project Activation Agent for a Trouble Ticket System Junichi Suga (Fujitsu Lab), Tomoyuki Harada, Kunitake Sugimoto, Yuta Miyayama (Fujitsu), Masaaki Kawai, Masafumi Kato (Fujitsu Lab), Hirotaka Yamada, Yuuichi Yamagishi, Shuji Miyata (Fujitsu) NS2018-202 |
A lot of services based on matching technology are penetrated today such as e-commerce, travel reservation and contents ... [more] | NS2018-202 pp.51-56 |
| WBS, IT, ISEC | 2018-03-08 09:50 |
Tokyo | Katsusika Campas, Tokyo University of Science | Succinct Oblivious RAM Taku Onodera, Tetsuo Shibuya (IMSUT) IT2017-119 ISEC2017-107 WBS2017-100 |
As online storage services become increasingly common, it is important that users’ private information is protected from... [more] | IT2017-119 ISEC2017-107 WBS2017-100 pp.89-96 |
| SS, KBSE, IPSJ-SE [detail] | 2017-07-19 17:00 |
Hokkaido | A Study on Discerning Hidden Critical Rules in Legacy Information Systems Masayuki Inoue, Akio Jin, Keitaro Horikawa (NTT), Noriaki Izumi (AIST) SS2017-13 KBSE2017-13 |
As large-scale systems are so expensive, they are often kept in operation for long periods even though they may not perf... [more] | SS2017-13 KBSE2017-13 pp.73-78 |
|
| 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 |
| ICM, LOIS | 2016-01-21 15:30 |
Fukuoka | Fukuoka Institute of Technology | A Data Structure Conversion Method for Electronic Forms Reflecting Graphical Representation Rule Ikuko Takagi, Kouichi Yamada, Tsutomu Maruyama (former NTT) ICM2015-30 LOIS2015-52 |
In various works of enterprises, form documents are utilized to communicate information between departments or persons i... [more] | ICM2015-30 LOIS2015-52 pp.25-30 |
| ICSS, IA | 2014-06-06 14:50 |
Hyogo | Takikawa Memorial Hall, Kobe University | List Representation Using Succinct Data Structure for Packet Filtering Yuta Kitamura (Nagoya Inst. of Tech.), Masami Mohri (Gifu Univ.), Yoshiaki Shiraishi (Kobe Univ.), Akira Iwata (Nagoya Inst. of Tech.) IA2014-12 ICSS2014-12 |
In packet filtering, increase of filtering rules causes the following two problems; complication of grasping all rules a... [more] | IA2014-12 ICSS2014-12 pp.61-65 |
| IT | 2013-09-27 10:55 |
Okinawa | Culture Resort Festone (Okinawa) | Performance Analysis on Invertible Bloom Lookup Tables with Erasure Errors Daichi Yugawa, Tadashi Wadayama (Nagoya Inst. of Tech.) IT2013-35 |
The Invertible Bloom Lookup Tables (IBLT) is a data structure which supports insertion, deletion, retrieval and listing ... [more] | IT2013-35 pp.19-24 |
| COMP | 2013-03-18 13:45 |
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 pp.23-30 |
| IT, ISEC, WBS | 2013-03-08 15:10 |
Osaka | Kwansei Gakuin Univ., Osaka-Umeda Campus | Finite Length Analysis of Invertible Bloom Lookup Tables Daichi Yugawa, Tadashi Wadayama (Nagoya Inst. of Tech.) IT2012-102 ISEC2012-120 WBS2012-88 |
The Invertible Bloom Lookup Tables (IBLT) is a probabilistic data structure which supports insertion, deletion, retrieva... [more] | IT2012-102 ISEC2012-120 WBS2012-88 pp.251-256 |
| HCGSYMPO (2nd) |
2012-12-10 - 2012-12-12 |
Kumamoto | Kumamoto-Shintoshin-plaza | Toward an augmented experiences behavior simulator for understanding behavioral and psychological symptoms of dementia Masahiro Fujita, Takamasa Nagao (Shizuoka Univ.), Hideki Ueno (Shizuoka Univ./Kaijoryo), Akira Tamai (Tsuruga Onsen Hospital), Shogo Ishikawa, Yoichi Takebayashi (Shizuoka Univ.) |
We propose an augmented experiences behavior simulator for understanding Behavioral and Psychological Symptoms of Dement... [more] | |
| 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 |
| COMP | 2011-10-21 15:50 |
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] |
COMP2011-34 pp.39-46 |
| 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 |
| KBSE, SS | 2010-05-27 11:20 |
Kyoto | Doshisha University, Imadegawa Campus | A Basic Study of Cognitive Processing based on Ontology Oriented Architecture Chiaki Kino, Yoshio Suzuki, Hiroshi Takemiya (JAEA) SS2010-2 KBSE2010-2 |
Ontology Oriented Architecture (OOA) has been proposed to actualize an annotation system which is able to extract meani... [more] |
SS2010-2 KBSE2010-2 pp.9-14 |
[Return to Top Page]