| 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 # | |
| NS, IN (Joint) |
2010-03-05 09:30 |
Miyazaki | Miyazaki Phoenix Seagaia Resort (Miyazaki) | An Efficient Indexing for Slightly Disordered Time-series Sensor Data Takahiro Yamazaki, Takeru Inoue, Hiroshi Sato (NTT), Junichiro Takagi, Masateru Minami (The Univ. of Tokyo), Noriyuki Takahashi (NTT)  IN2009-184 |
Recently, an evolution of a sensor and network technology grows possibility of sensing the real world conditions which a... [more] | IN2009-184 pp.241-246 |
| 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 |
|
| ITE-ME, ITS, IE, ITE-HI, ITE-AIT | 2007-02-22 17:05 |
Hokkaido | Hokkaido University | Information Embedding by Multiple Components Based on Lifting of the Color Space of an Image Masataka Yamazaki, Mitsugu Kakuta, Yukio Kosugi (Tokyo Tech.) |
The data structure of a RGB color image is utilized by the information embedding based on KL (Karhunen Loeve) transforma... [more] | ITS2006-67 IE2006-252 pp.135-139 |
| 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 |
| ITS, IE, ITE-ME, ITE-AIT, ITE-HI | 2006-02-21 10:40 |
Hokkaido | Hokkaido Univ. | An Image Based Data Hiding by a Key in Karhunen Loeve Space Takeshi Yamamoto, Mitsugu Kakuta, Yukio Kosugi (Tokyo Inst. of Tech.) |
A digital watermark is useful technology as a method to embed kind of key information for proof to digital contents. The... [more] | ITS2005-83 IE2005-290 pp.23-28 |
| 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 |
| COMP | 2005-09-15 10:50 |
Osaka | Osaka Univ., Toyonaka Campus | Laminar Structure of Ptolemaic Graphs and Its Applications Ryuhei Uehara (JAIST), Yushi Uno (Osaka Pref. Univ.) |
Ptolemaic graphs are graphs that satisfy the Ptolemaic inequality for any four vertices. The graph class coincides with... [more] |
COMP2005-30 pp.17-24 |
[Return to Top Page]