|
|
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 # |
MSS, SS |
2019-01-16 09:50 |
Okinawa |
|
Extending Narrowing Trees to Basic Narrowing in Term Rewriting Yuya Maeda, Naoki Nishida, Masahiko Sakai, Tomoya Kobayashi (Nagoya Univ.) MSS2018-68 SS2018-39 |
Narrowing computation of a term rewriting system is an extension of rewriting by replacing matching with unification, wh... [more] |
MSS2018-68 SS2018-39 pp.73-78 |
PRMU, DE |
2005-06-17 14:50 |
Hokkaido |
Hokkaido Univ. |
Finding an Optimum Edit Script between an XML Document and a Regular Tree Grammar Nobutaka Suzuki (Univ. of Tsukuba) |
So far many algorithms for finding an optimum edit script between two XML documents have been proposed, but few studies ... [more] |
DE2005-25 PRMU2005-46 pp.69-74 |
DE, DC |
2004-10-19 14:00 |
Tokyo |
Tokyo Institute of Technology |
Schema update operations preserving the expressive power in XML databases Kenji Hashimoto, Yasunori Ishihara, Toru Fujiwara (Osaka Univ.) |
This paper proposes schema update operations preserving the expressive power in XML databases. In this paper, the inform... [more] |
DE2004-118 DC2004-33 pp.25-30 |
|
|
|
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]
|