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 - 6 of 6  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
RCS, SR, SRW
(Joint)
2021-03-05
09:00
Online Online Interaction Between Communication Systems With and Without Time-Division Control
Hiroshi Aoki, Shinji Yamaguchi, Akio Hasegawa, Hiroyuki Yokoyama (ATR) RCS2020-246
In time-division communication systems in wireless LAN, it is often assumed that all devices in the system perform time-... [more] RCS2020-246
pp.189-194
COMP 2015-09-01
14:30
Nagano   Enumerating and Indexing Walks Between Any Pair of Vertices
Hiroshi Aoki, Norihito Yasuda, Shin-ichi Minato (Hokkaido Univ.) COMP2015-21
This paper presents a method for enumerating and indexing all the walks between any two points in a given graph.
It is ... [more]
COMP2015-21
pp.35-39
COMP 2013-10-18
10:40
Aichi Nagoya Institute of Technology Three-way Indexing ZDDs for Large Scale Sparse Dataset
Hiroshi Aoki (Hokkaido Univ.), Takahisa Toda (JST), Shin-ichi Minato (Hokkaido Univ.) COMP2013-32
 [more] COMP2013-32
pp.1-8
AP 2013-01-23
13:50
Miyazaki Hotel Merieges (Miyazaki City) Scale Model Method for Mobile Propagation in Urban Area and Residential Area
Hiroshi Aoki, Nozomu Kawasaki, Tomoharu Honda, Shinichi Ichitsubo (kyutech) AP2012-128
In the research methods for radio propagation, the computer simulation and the measurement in a real city had been perfo... [more] AP2012-128
pp.37-42
COMP 2012-04-27
13:20
Osaka Osaka Prefecture University Sequence Binary Decision Diagrams with Mapping Edges
Hiroshi Aoki, Shigeru Yamashita (Ritsumeikan Univ.), Shin-ichi Minato (Hokkaido Univ.) COMP2012-4
A Binary Decision Diagram (BDD) gives efficient boolean function manipulations. The memory efficiency of BDDs depends on... [more] COMP2012-4
pp.23-28
COMP 2011-04-22
10:50
Kyoto Kyoto University Construction of a SeqBDD representing a set of reversed sequences
Hiroshi Aoki, Shigeru Yamashita (Ritsumeikan Univ.), Shin-ichi Minato (Hokkaido Univ.) COMP2011-3
A trie is a data structure representing a set of sequences by sharing the same prefixes between sequences. Thanks to thi... [more] COMP2011-3
pp.17-23
 Results 1 - 6 of 6  /   
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