|
|
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 # |
IT, ISEC, RCC, WBS |
2022-03-11 16:25 |
Online |
Online |
An Efficient Method for Constructing Garbled Circuits Using Linked Lists Guangjian Liu, Hikaru Morita (Graduate School of Kanagawa Univ) IT2021-131 ISEC2021-96 WBS2021-99 RCC2021-106 |
Since the proposal of the Garbled Circuit by Yao, a number of construction methods for secret circuits have been propose... [more] |
IT2021-131 ISEC2021-96 WBS2021-99 RCC2021-106 pp.281-284 |
COMP |
2014-12-05 11:00 |
Kumamoto |
Sojo University |
On Zero-Suppressed Binary Decision Diagrams and Complexity Theory Hiroki Morizumi (Shimane Univ.) COMP2014-34 |
Zero-suppressed binary decision diagrams (ZDDs) are a data structure representing Boolean functions, and one of the most... [more] |
COMP2014-34 pp.17-19 |
NLP, CAS |
2014-10-16 10:15 |
Ehime |
Ehime University |
Enumerating and Indexing of Polyiamonds for p6 Tiling by Using ZDDs Tomoki Nozawa, Toshihiko Takahashi (Niigata Univ.) CAS2014-54 NLP2014-48 |
A p6 tiling is a plane tiling by 6-fold rotational copies of a single figure.
A polyiamond or n-iamond is a figure cons... [more] |
CAS2014-54 NLP2014-48 pp.17-22 |
COMP |
2013-03-18 13:45 |
Gifu |
Gifu University |
Compact and Fast Indices Based on Zero-Suppressed Binary Decision Diagrams Shuhei Denzumi (Hokkaido Univ.), Jun Kawahara (NAIST), Koji Tsuda (AIST/JST), Hiroki Arimura (Hokkaido Univ.), Shin-ichi Minato (Hokkaido Univ./JST), Kunihiko Sadakane (NII) COMP2012-56 |
In many real-life problems, we are often faced with manipulating families of sets. Manipulation of large-scale set famil... [more] |
COMP2012-56 pp.23-30 |
PRMU, DE |
2008-06-19 15:00 |
Hokkaido |
Otaru-Shimin-Kaikan |
Knowledge Discovery and Compression by Using Zero-suppressed BDDs Ryutaro Kurai, Shin-ichi Minato, Thomas Zeugmann (Hokkaido Univ.) DE2008-10 PRMU2008-28 |
In the present paper we propose a new method for clustering text data by using
the Normalized Compression Distance and ... [more] |
DE2008-10 PRMU2008-28 pp.53-58 |
AI |
2007-05-31 14:00 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
[Invited Talk]
Recent Topics on Data Mining and Knoledge Discovery Using Binary Decision Diagrams Shin-ichi Minato (Hokkaido Univ.) AI2007-6 |
Binary Decision Diagrams (BDDs) are the efficient data structure for representing Boolean functions on the main memory. ... [more] |
AI2007-6 pp.27-32 |
COMP |
2005-05-20 14:05 |
Fukuoka |
Kyushu Univ. |
VSOP: Valued-Sum-Of-Products Calculator Based on Zero-Suppressed BDDs Shin-ichi Minato (Hokkaido Univ.) |
Recently, Binary Decision Diagrams (BDDs) are widely used for manipulating large-scale Boolean function data. Zero-suppr... [more] |
COMP2005-13 pp.31-38 |
|
|
|
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]
|