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 - 7 of 7  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
SIS 2019-12-13
11:05		 Okayama Okayama University of Science Improvement of Grayscale Conversion Method Using Vertex Coloring Algorithm
Siwen Zhang, Go Tanaka (Nagoya City Univ.) SIS2019-34		 Identical gray level is assigned to pixels which have same lightness in usual grayscale conversion and these pixels cann... [more] SIS2019-34
pp.57-60
SIS 2019-03-07
11:55		 Tokyo Tokyo Univ. Science, Katsushika Campus Expansion of Grayscale Conversion Method Using Vertex Coloring Algorithm
Siwen Zhang, Go Tanaka (Nagoya City Univ.) SIS2018-50		 Identical gray level is assigned to regions which have same lightness in usual grayscale conversion and these regions ca... [more] SIS2018-50
pp.71-74
SIS 2013-06-13
13:55		 Kagoshima Houzan Hall (Kagoshima) A Proposal of Grayscale Conversion Using Vertex Coloring Algorithm
Go Tanaka (Nagoya City Univ.) SIS2013-5		 Adjacent iso-lightness regions are converted into identical gray-level by the existing lightness-based method and it is ... [more] SIS2013-5
pp.23-26
COMP 2012-03-16
13:35		 Tokyo Univ. of Tokyo Parameterized complexity of coloring comparability-ke graphs
Atsuhsi Saito, Yasuhiko Takenaga (UEC) COMP2011-51		 $\mathcal{F}-ke$ graphs is a class of graphs obtained by deleting at most $k$ edges from a graph in graph class $\mathca... [more] COMP2011-51
pp.31-38
COMP 2008-05-13
15:55		 Fukuoka Kyushu Sangyo University An O(n^{1.75})-time Algorithm for L(2,1)-labeling of Trees
Toru Hasunuma (Univ. Tokushima), Toshimasa Ishii (Otaru Univ. of Commerce), Hirotaka Ono (Kyushu Univ.), Yushi Uno (Osaka Prefecture Univ.) COMP2008-14		 An $L(2,1)$-labeling of a graph $G$ is an assignment $f$
from the vertex set $V(G)$ to the set of nonnegative integers... [more]		 COMP2008-14
pp.43-50
COMP 2005-04-18
10:00		 Hyogo Kwansei Gakuin Univ. A fast algorithm for calculating an upper bound of the weight of the maximum weighted clique
Kazuaki Yamaguchi, Sumio Masuda (Kobe Univ.) 		We deal with the optimization problem that requies the maximum weighted
clique of undirected graphs. Some exact algori... [more]		 COMP2005-1
pp.1-4
COMP 2005-03-18
15:25		 Tokyo Tokyo Institute of Technology Complexity of coloring comparability + ke graphs
Kenichi Higashide, Yasuhiko Takenaga (UEC) 		A comparability+ke graph is a graph that can be obtained from a comparability graph by adding at most k edges. In this r... [more] COMP2004-82
pp.71-77
 Results 1 - 7 of 7  /   
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