|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
ICSS, IPSJ-SPT |
2016-03-03 13:40 |
Kyoto |
Academic Center for Computing and Media Studies, Kyoto University |
Storage-Efficient and Low-Power Packet Classification for Internet of Things Yuta Kitamura (Nagoya Inst. of Tech.), Masami Mohri (Gifu Univ.), Yoshiaki Shiraishi (Kobe Univ.) ICSS2015-49 |
This paper addresses packet classification for Internet of Things (IoT) security. Packet Classification is a function to... [more] |
ICSS2015-49 pp.13-18 |
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 |
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 |
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 |
2007-06-29 17:25 |
Hokkaido |
Hokkaido University |
Succinct Array Structure for Patricia Trie Susumu Yata, Kazuhiro Morita, Masao Fuketa, Jun-ichi Aoe (Tokushima Univ.) COMP2007-31 |
A patricia trie is available by removing internal nodes which have just onechild from a binary trie, and is applied to f... [more] |
COMP2007-31 pp.101-106 |
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 |
|
|
|
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]
|