|
|
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 # |
RCS |
2019-04-19 09:30 |
Hokkaido |
Noboribetsu Grand Hotel |
A Study on Low Complexity Fair User Scheduling Employing Spatial Orthogonality for MU-MIMO Systems Ei Nandar Maung, Yukiko Shimbo, Hirofumi Suganuma, Fumiaki Maehara (Waseda Univ.) RCS2019-13 |
This report proposes a low complexity fair user scheduling method employing semiorthogonal user selection (SUS) for mult... [more] |
RCS2019-13 pp.55-59 |
SIP, EA, SP, MI (Joint) [detail] |
2018-03-19 13:00 |
Okinawa |
|
[Poster Presentation]
Optimization of Computational Scheduling for Acceleration of Directional Cubic Convolution Interpolation Tomohiro Sasaki, Yoshihiro Maeda, Masahiro Nakamura, Norishige Fukushima (Nagoya Inst. of Tech.) EA2017-128 SIP2017-137 SP2017-111 |
Directional cubic convolution interpolation is a highly accurate image upsampling method considering edge directions.
I... [more] |
EA2017-128 SIP2017-137 SP2017-111 pp.149-154 |
COMP |
2015-04-23 15:25 |
Miyagi |
|
Computational Complexity of Generalized Makespan Minimization Problem Tsunehiko Nagayama, Kunihiko Sadakane (Univ. of Tokyo) COMP2015-4 |
We generalize the makespan minimization problem on unrelated parallel machines and formulate the generalized makespan mi... [more] |
COMP2015-4 pp.21-25 |
COMP |
2014-09-02 13:30 |
Aichi |
Toyohashi University of Technology |
[Invited Talk]
Modeling and Algorithm/Complexity Theory
-- Scheduling in Railroad, AGV(Automated Guided Vehicle) NPB League as Examples -- Shigeru Masuyama (Toyohashi Univ. of Tech.) COMP2014-19 |
This paper discuss and suggest how knowledge on algorithm design theory and computational complexity theory help to mo... [more] |
COMP2014-19 pp.29-34 |
AP, RCS (Joint) |
2011-11-17 10:35 |
Aichi |
Nagoya Congress Center |
A Proposal of Multi-user MIMO Scheduling Method with Low Complexity Kazuhide Toda, Yasuyuki Hatakawa, Tomoko Matsumoto, Satoshi Konishi (KDDI R&D Labs.) RCS2011-210 |
This paper proposes a scheduling method with low complexity for the downlink multi-user MIMO. The decision
of the numbe... [more] |
RCS2011-210 pp.127-132 |
IN |
2007-07-20 09:30 |
Hyogo |
Kobe University |
An Effective Information Searching with Computational Resources Scattered a Large-Scale Network Shota Kondo, Shinji Sugawara, Yutaka Ishibashi (NIT) IN2007-32 |
In this article, we propose an efficient resource distribution scheduling scheme for information retrieval from multiple... [more] |
IN2007-32 pp.31-36 |
|
|
|
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]
|