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  (All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 20 of 21  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2019-09-02
14:15
Okayama Tsushima Campus, Okayama University Space efficient separator algorithms for planar graphs
Osamu Watanabe (Tokyo Inst. of Tech.) COMP2019-13
The Separator Theorem states that any planar graph G with n vertices has a separator of size O(n^{1/2}), that is, a set ... [more] COMP2019-13
pp.17-24
COMP 2018-12-12
10:50
Miyagi Tohoku University Minimization of an M-convex Function under L1-distance Constraint
Akiyoshi Shioura (Tokyo Inst. Tech.) COMP2018-33
In this paper we consider a new problem of minimizing an M-convex function under L1-distance constraint (MML1); the cons... [more] COMP2018-33
pp.15-20
COMP, IPSJ-AL 2016-06-25
13:15
Ishikawa   An algorithm for 3-SAT problems
Hiroshi Tsukimoto (Tokyo Denki Univ.) COMP2016-10
This paper presents an algorithm for 3-SAT problems. First, logical formulas are transformed into elementary algebraic f... [more] COMP2016-10
pp.89-96
COMP, IPSJ-AL 2016-06-25
15:05
Ishikawa   Computational Complexity of Sequential Token Swapping Problem
Katsuhisa Yamanaka (Iwate Univ.), Erik D. Demaine (MIT), Takashi Horiyama (Saitama Univ.), Akitoshi Kawamura (Univ. of Tokyo), Shin-ichi Nakano (Gunma Univ.), Yoshio Okamoto (UEC), Toshiki Saitoh (Kobe Univ.), Akira Suzuki (Tohoku Univ.), Ryuhei Uehara (JAIST), Takeaki Uno (NII) COMP2016-13
We consider a puzzle consisting of colored tokens on an $n$-vertex graph, where each token has a distinct starting verte... [more] COMP2016-13
pp.115-121
NS, IN
(Joint)
2015-03-02
09:30
Okinawa Okinawa Convention Center Polynomial-time Algorithm for Traffic Engineering by Link Metric Update
Shinya Kurimoto, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2014-185
In general, a route determined by an internet routing protocol such as OSPF and BGP is the shortest path that the sum of... [more] NS2014-185
pp.53-58
NS, IN
(Joint)
2014-03-07
09:50
Miyazaki Miyazaki Seagia Server Access Traffic Control by Link Metric Update
Takahiro Munechika, Akira Noguchi, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2013-228
Recently, with the spread of broadband Internet access and video contents provide services, large contents in the Intern... [more] NS2013-228
pp.301-306
NS, IN
(Joint)
2014-03-07
08:50
Miyazaki Miyazaki Seagia Sever Location Method for Keeping Shorter Distance from Clients to Servers during Failures
Nao Maeda, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2013-243
Recently, large contents in the Internet have increased loads of contents servers, networks and data centers which may d... [more] NS2013-243
pp.385-390
NS, IN
(Joint)
2013-03-08
13:40
Okinawa Okinawa Zanpamisaki Royal Hotel Method for Finding Links Protected for Keeping the Shorter Distance from Clients to Servers during Failures
Nao Maeda, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-251
Recently, large-volume contents distributed by a content delivery network~(CDN) on the Internet increase load of content... [more] NS2012-251
pp.499-504
NS, IN
(Joint)
2013-03-08
14:00
Okinawa Okinawa Zanpamisaki Royal Hotel Method for Finding Links Protected to Keep Reachability to Server during Simultaneous Two Links Failures
Koji Imagawa, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-252
The critical links whose failures decrease nodes which is connected with a server in a network must be protected not to ... [more] NS2012-252
pp.505-510
NS, IN
(Joint)
2013-03-08
13:00
Okinawa Okinawa Zanpamisaki Royal Hotel Method for Finding Links Protected against Increase of Path Length during Failures
Kohei Nishida, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2012-265
A telecommunication network should be reliable, since it is important as social infrastructure. However, in many actual ... [more] NS2012-265
pp.583-588
MSS 2013-01-22
14:25
Osaka Osaka Int. Convention Center On Polynomial Time Checking on Reachability in Sound Extended Free-Choice Workflow Nets
Daiki Kano, Shingo Yamaguchi (Yamaguchi Univ.) MSS2012-48
There are two aspects of a workflow: definition and instance.
In this paper, we tackle verification of correctness of w... [more]
MSS2012-48
pp.17-21
CAS, MSS 2011-11-18
11:15
Yamaguchi Univ. of Yamaguchi On Reachability Verification for Acyclic Well-Structured Work
Shinji Hamano, Shingo Yamaguchi (Yamaguchi Univ.) CAS2011-78 MSS2011-47
Workflow nets are making great contributions for modeling and analysis of workflows.
In this paper, we tackle verificat... [more]
CAS2011-78 MSS2011-47
pp.83-87
IN, NS
(Joint)
2011-03-03
08:40
Okinawa Okinawa Convention Center Method for Finding Links Protected for Network Load Balancing during Failures
Akira Noguchi, Takeshi Fujimura, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2010-173
The internet reliability is needed as the Internet becomes an important social infrastructure. However, we face the ris... [more] NS2010-173
pp.57-62
IN, NS
(Joint)
2011-03-03
09:20
Okinawa Okinawa Convention Center Method for Finding Links Protected to Keep Reachability to Server during Failures
Koji Imagawa, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2010-175
The critical links whose failures decrease nodes which is connected with a server in a network must be protected not to ... [more] NS2010-175
pp.69-74
IN, NS
(Joint)
2011-03-04
14:10
Okinawa Okinawa Convention Center Control Method of Autonomously Formed Unstructured P2P Network Based on Usage History
Keishi Ogura, Hiroyoshi Miwa (Kwansei Gakuin Univ.) IN2010-206
P2P(Peer-to-Peer) network systems in contrast to client/server systems is expected in many fields such as not only file ... [more] IN2010-206
pp.371-376
IBISML 2010-11-04
15:00
Tokyo IIS, Univ. of Tokyo [Poster Presentation] Efficient Implementation of Greedy Cover Learning by Hyper-Rectangles and Its Classification Performance Evaluation Using Real Data
Koji Ouchi, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) IBISML2010-72
Blumer et al. showed that
the class of concepts represented by finite unions
of hyper-rectangles
in $d$-dimensional ... [more]
IBISML2010-72
pp.99-104
NS, IN
(Joint)
2010-03-05
10:20
Miyazaki Miyazaki Phoenix Seagaia Resort (Miyazaki) Traffic Engineering by Polynomially Solvable Link Metric Optimization
Akira Noguchi, Takeshi Fujimura, Hiroyoshi Miwa (Kwansei Gakuin Univ.) NS2009-229
Open Shortest Path First (OSPF) is the most commonly used intra-domain internet routing protocol. As the routes of paths... [more] NS2009-229
pp.375-380
COMP 2009-10-16
15:25
Miyagi Tohoku University An Improved Approximation Lower Bound for Maximum Cardinality Almost Stable Matching Problem
Koki Hamada, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) COMP2009-37
In the stable marriage problem that allows incomplete preference
lists, all stable matchings for a given instance have ... [more]
COMP2009-37
pp.35-40
MSS 2009-08-06
15:20
Tokyo JAIST Tokyo Campus Polynomial-time Algorithm for Controllability Test of Boolean Networks
Koichi Kobayashi (JAIST), Jun-ichi Imura (Tokyo Inst. of Tech.), Kunihiko Hiraishi (JAIST) CST2009-14
This paper proposes a polynomial-time algorithm to determine if a Boolean network with control nodes and controlled node... [more] CST2009-14
pp.13-18
CAS, CS, SIP 2009-03-03
13:10
Gifu Nagaragawa Convention Center [Poster Presentation] A Note on Two Problems of Nano-PLA Design
Anish Man Singh Shrestha, Tomoki Yamada, Satoshi Tayu, Shuichi Ueno (Tokyo Inst of Tech) CAS2008-133 SIP2008-196 CS2008-107
This paper shows that the subgraph isomorphism problem is NP-hard even for bipartite permutation graphs, while the balan... [more] CAS2008-133 SIP2008-196 CS2008-107
pp.183-184
 Results 1 - 20 of 21  /  [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. (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