IEICE Technical Committee Submission System
Conference Schedule
Online Proceedings
[Sign in]
... (for ESS/CS/ES/ISS)
Tech. Rep. Archives
... (for ES/CS)
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 35件中 1~20件目  /  [Next]  
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
QIT
(2nd)
2019-11-18
13:50
Tokyo Gakushuin University [Poster Presentation] Localization phenomena in constrained quantum annealing
Kazue Kudo (Ochanomizu Univ.)
Quantum annealing is known as a quantum-mechanical approach for optimization problems. Constrained quantum annealing is ... [more]
ICTSSL, IN 2019-10-17
10:00
Oita   Graph coloring considering release of communication channels and the upper bounds of the number of channels
Hiroshi Tamura, Hiromu Narita (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2019-16 IN2019-30
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] ICTSSL2019-16 IN2019-30
pp.1-4
COMP 2019-09-02
11:25
Okayama Tsushima Campus, Okayama University Speeding-up of Construction Algorithms for the Graph Coloring Problem
Kazuho Kanahara, Kengo Katayama (OUS), Etsuji Tomita (UEC), Takeshi Okano, Takahumi Miyake, Noritaka Nishihara (OUS) COMP2019-11
DSATUR and RLF are well known as typical solution construction algorithms for the graph coloring problem, GCP, where GCP... [more] COMP2019-11
pp.7-14
ICTSSL 2019-07-17
10:25
Aomori Aomori Tourist Information Center, ASPAM On the realization of Grundy number on minimizing the number of vertices or edges of graphs(Second report)
Hiroshi Tamura, Shun Matsumoto (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2019-13
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] ICTSSL2019-13
pp.23-28
ICTSSL 2019-05-30
15:50
Hokkaido HOKKAIDO CHUSYO KIGYO KAIKAN On the realization of Grundy number on minimizing the number of vertices or edges of graphs
Hiroshi Tamura, Shun Matsumoto (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2019-3
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] ICTSSL2019-3
pp.11-16
QIT
(2nd)
2019-05-21
16:10
Fukuoka Kyushu University, Chikushi Campus Exponential-Time Quantum Algorithm for Graph Coloring Problem
Kazuya Shimizu, Ryuhei Mori (TiTech)
In this work, we show an exponential-time quantum algorithm for the graph k-coloring problem, which is one of the well-k... [more]
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
COMP 2018-12-12
10:25
Miyagi Tohoku University Linear-Time Algorithms for the Generalized Coloring Reconfiguration Problem
Hiroki Osawa, Akira Suzuki, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2018-32
{sc Coloring reconfiguration} is one of the most well-studied reconfiguration problems. In the problem, we are given two... [more] COMP2018-32
pp.7-14
IN, ICTSSL, NWS
(Joint) [detail]
2018-10-19
10:35
Kagawa Takamatsu Shoko Kaigisyo Kaikan On some results on Grundy Coloring of graphs
Hiroshi Tamura, Shun Matsumoto (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2018-29 IN2018-46
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] ICTSSL2018-29 IN2018-46
pp.19-23
ICTSSL 2018-07-18
09:00
Tokyo NTT Musashino R&D Center Relationship between graph coloring and channel assignment in wireless communication
Hiroshi Tamura, Shun Matsumoto (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2018-20
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] ICTSSL2018-20
pp.23-27
AI 2018-07-02
10:25
Hokkaido   Solving Constraint Satisfaction Problems Using Ant Colony Optimization with Multi-Pheromones
Takuya Masukane, Kazunori Mizuno (Takushoku Univ.) AI2018-2
Ant colony optimization, ACO, is one of the meta-heuristics. ACO has been effective to solve constraint satisfaction pro... [more] AI2018-2
pp.7-10
ICTSSL 2016-06-15
13:50
Miyagi Tohoku University On the number of channels in wireless networks from the standpoint of graph colorings
Hiroshi Tamura, Shun Matsumoto (Chuo Univ.), Keisuke Nakano (Niigata Univ.) ICTSSL2016-15
The relation of channel assignment problems in wireless communications and coloring problems of graph theory is well-kno... [more] ICTSSL2016-15
pp.85-90
COMP 2014-10-08
14:45
Tokyo Chuo University Reconfiguration of List Colorings in a Graph
Tatsuhiko Hatanaka, Takehiro Ito, Xiao Zhou (Tohoku Univ.) COMP2014-29
We study the problem of transforming one list (vertex) coloring of a graph into another list coloring by changing only o... [more] COMP2014-29
pp.19-24
VLD 2014-03-04
14:40
Okinawa Okinawa Seinen Kaikan Self-Aligned Double and Quadruple Patterning-Aware Grid Routing
Chikaaki Kodama (Toshiba), Hirotaka Ichikawa (Toshiba Microelectronics), Fumiharu Nakajima, Koichi Nakayama, Shigeki Nojima, Toshiya Kotani (Toshiba) VLD2013-151
Self-Aligned Double and Quadruple Patterning (SADP, SAQP) are leading candidates for sub-$20~nm$ and sub-$14~nm$ node an... [more] VLD2013-151
pp.99-104
MSS, CAS, IPSJ-AL [detail] 2013-11-07
09:55
Iwate   A Note on Two-Directional Orthogonal Ray Graphs and Related Graphs
Asahi Takaoka, Satoshi Tayu, Shuichi Ueno (Tokyo Inst. of Tech.) CAS2013-65 MSS2013-44
An orthogonal ray graph is an intersection graph of horizontal and vertical rays (half-lines) in the plane. An orthogona... [more] CAS2013-65 MSS2013-44
pp.99-104
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 2013-03-18
14:10
Gifu Gifu University A note on lower bounds of the girth of planar C_7-colorable graphs
Tatsuo Asano, Akihiro Uejima (Osaka Electro-Comm. Univ.) COMP2012-57
This report considers the $C_{2k+1}$-coloring problem, which is a subproblem for the $n/k$-coloring problem,
where $n,... [more]
COMP2012-57
pp.31-38
CAS 2013-01-28
14:30
Oita Beppu International Convention Center Evaluation of edge coloring for channel assignment in wireless networks
Yusuke Ashida, Hiroshi Tamura (Chuo Univ.), Shoji Shinoda (Waseda Univ.) CAS2012-75
Ad hoc networks consist of mobile tereminals with personal communication devices. Each terminal can receive a message fr... [more] CAS2012-75
pp.53-58
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
 35件中 1~20件目  /  [Next]  
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. (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