|
|
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 # |
CCS, NLP |
2022-06-10 17:10 |
Osaka |
(Primary: On-site, Secondary: Online) |
Application of pairing optimization algorithm to non-orthogonal multiple access Naoki Fujita, Andre Roehm, Takatomo Mihana, Ryoichi Horisaki (The Univ. of Tokyo), Aohan Li (The Univ. of Electro-Communications), Mikio Hasegawa (Tokyo Univ. of Science), Makoto Naruse (The Univ. of Tokyo) NLP2022-25 CCS2022-25 |
Non-Orthogonal Multiple Access (NOMA) is a promising next-generation communication technology that enables multiple term... [more] |
NLP2022-25 CCS2022-25 pp.129-134 |
COMP |
2012-06-21 11:00 |
Hokkaido |
Hokkaido University |
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees Tatsuya Akutsu, Takeyuki Tamura (Kyoto Univ.), Daiji Fukagawa (Doshisha Univ.), Atsuhiro Takasu (NII) COMP2012-15 |
This report presents efficient exponential time algorithms for the unordered tree edit distance problem, which is known ... [more] |
COMP2012-15 pp.25-31 |
|
|
|
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]
|