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  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 5 of 5  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2019-12-13
15:00
Gunma Ikaho Seminar House, Gunma University On Ambiguous Reasoning of Multiple Input Variables Combination by Utilizing Additive Results
Yoko Kamidoi, Shin'ichi Wakabayashi (Hiroshima City Univ.) COMP2019-38
 [more] COMP2019-38
pp.61-68
IT, EMM 2018-05-17
16:00
Tokyo Ookayama Campus, Tokyo Institute of Technology Security Level Oriented Scheduling over the Flex Ray Static Segment based on Mixed-Integer Linear Programing
Tsubasa Ikeda, Yoko Kamidoi, Shin'ichi Wakabayashi (Hiroshima City Univ.) IT2018-5 EMM2018-5
 [more] IT2018-5 EMM2018-5
pp.25-30
DE 2010-12-06
17:20
Tokyo AIST Tokyo Akihabara Site An Efficient Prevention Method of Deviation from an Anonymous Data Collection Protocol
Yuya Nojima, Yoko Kamidoi, Shin'ichi Wakabayashi (Hiroshima City Univ.) DE2010-36
Rational players deviate from a communication protocol when they can get more profit than one got if they follow the pro... [more] DE2010-36
pp.61-66
COMP 2007-12-14
16:50
Hiroshima Hiroshima University An improvement of cuncurrent extensible hash tables to reduce contension costs
Naoya Sueda, Yoko Kamidoi, Shin'ichi Wakabayashi (Hiroshima City Univ.) COMP2007-54
We improve the split-ordered list hash algorithm(SOL) proposed by
Shalev and Nir that can process multiple operations c... [more]
COMP2007-54
pp.43-50
COMP 2005-06-24
16:00
Toyama   A Deterministic Algorithm for Finding All Minimum k-Way Cuts
Yoko Kamidoi, Noriyoshi Yoshida (Hiroshima City Univ.), Hiroshi Nagamochi (Kyoto Univ.)
Let $G=(V,E)$ be an edge-weighted
undirected graph with $n$ vertices and $m$ edges.
We present a deterministic algori... [more]
COMP2005-26
pp.51-58
 Results 1 - 5 of 5  /   
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