| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2022-05-19 15:40 |
Online | Online | On Time Complexity of Distributed Minimum Spanning Tree Construction in the broadcast-CONGEST model for Restricted Graph Classes Narumi Shigekiyo, Toshimitsu Masuzawa, Taisuke Izumi (Osaka Univ.)  COMP2022-5 |
Broadcast-CONGEST is a variant of CONGEST, the standard computational model for distributed graph algorithms, with the r... [more] | COMP2022-5 pp.33-38 |
| NLP, NC (Joint) |
2019-01-24 15:00 |
Hokkaido | The Centennial Hall, Hokkaido Univ. | A Genetic Algorithm-Based Method for Finding Approximate Solutions to Minimum Steiner Tree Problems Li-Ping Zhang, Norikazu Takahashi (Okayama Univ.), Zong-Xiao Yang (HAUST) NLP2018-121 |
The Euclidean Steiner Tree Problem (ESTP) is a classical combinatorial optimization problem that appears in various fiel... [more] | NLP2018-121 pp.131-136 |
| KBSE, SS, IPSJ-SE [detail] | 2018-07-18 15:25 |
Hokkaido | Fault-Tolerant Topology determination for IoT network Mitsumasa Ota (Waseda Univ.), Ryuichi Takahashi (Ibaraki Univ.), Yoshiaki Fukazawa (Waseda Univ.) SS2018-10 KBSE2018-20 |
In IoT, the gateways are used as a relay point so that resources deployed in environment communicate with each other. Wh... [more] | SS2018-10 KBSE2018-20 pp.55-60 |
|
| SIS | 2016-03-11 10:10 |
Tokyo | Tokyo City Univ. | Impulse Noise Removal by Extended Median Filter Utilizing Minimum Spanning Tree with 8-neighborhood Saki Asamoto, Takanori Koga (NIT, Tokuyama College) SIS2015-63 |
In this study, we propose a random-valued impulse noise removal method with superior detail preservation capability by a... [more] | SIS2015-63 pp.87-92 |
| CS, CAS | 2016-02-26 10:55 |
Wakayama | Laforet Nanki-Shirahama Hotel | The Evaluation of Colleration between Two Variables using Mean and Standard Deviation of Edge Length in Minimum Spanning Tree Okuya Fuminori, Kawahara Yoshihiro, Asami Tohru (UTokyo) CAS2015-88 CS2015-93 |
Pearson product-moment correlation coefficient is famous for evaluating association of two individual variables. Howeve... [more] |
CAS2015-88 CS2015-93 pp.45-50 |
| COMP | 2015-03-09 14:15 |
Kyoto | Ritsumeikan University | Maximum Supply Rate and Minimum Supply Increase Rate of Supply and Demand Networks Hironori Yoshihara, Takao Nishizeki (KGU) COMP2014-47 |
Assume that a graph $G$ has $l$ sources, each assigned a non-negative integer called a supply, that all the vertices ot... [more] |
COMP2014-47 pp.31-37 |
| SANE | 2014-10-23 15:40 |
Overseas | Ramada Plaza Melaka, Malacca, Malaysia | Experimental study on graph-based image segmentation for the feature extraction of high-resolution satellite image Hyejin Kim (Seoul National Univ.), Byungkil Lee (Kyonggi Univ.), Yongil Kim (Seoul National Univ.) SANE2014-88 |
The development of image segmentation algorithms for remote sensing images has been greatly increased after the availabi... [more] | SANE2014-88 pp.135-138 |
| SIS, IPSJ-AVM | 2013-09-12 13:55 |
Tokyo | Waseda Univ. | Impulse Noise Removal by Using One-dimensional Switching Median Filter Applied along MST-based Space-filling Curve Takanori Koga (Tokuyama CT), Noriaki Suetake, Tsuyoshi Kato, Eiji Uchino (Yamaguchi Univ.) SIS2013-19 |
A switching median filter (SMF) is especially effective for impulse noise removal while still preserving edges in an inp... [more] | SIS2013-19 pp.27-32 |
| SIS | 2011-12-15 10:00 |
Yamaguchi | Image Enhancement by Using Edge-preserving Smoothing based on SFC-MST Takanori Koga (Tokuyama CT), Noriaki Suetake (Yamaguchi Univ.) SIS2011-39 |
We propose a novel decomposition-based image enhancement method with one-dimensional edge-preserving smoothing filter em... [more] | SIS2011-39 pp.1-4 |
|
| COMP | 2010-10-15 09:30 |
Miyagi | Tohoku Univ. | Constant-Work-Space Algorithms for Geometric Problems(1) Tetsuo Asano (JAIST), Wolfgang Mulzer (Princeton Univ.), Gunter Rote (Free Univ.), Yajun Wang (Microsoft) COMP2010-31 |
We present space-efficient algorithms for geometric problems in a restricted computational model called ``constant wo... [more] |
COMP2010-31 pp.1-7 |
| CS, CQ (Joint) |
2010-04-26 10:25 |
Aomori | Oirase Keiryu Hotel | ANew Delay-Aware-Routing Scheme with Use of Two Routing Tables Taking into Account Node Centricity Wataru Ogasa, Tohru Kataoka, Yoshio Sugizaki, Osamu Mizuno, Koichi Asatani (Kogakuin University) CQ2010-2 |
QoS-aware routing schemes are important for real-time applications like VoIP. The authors proposed the delay-aware routi... [more] | CQ2010-2 pp.7-12 |
| IN | 2009-12-10 10:50 |
Hyogo | KOBE UNIVERSITY | A New Delay-Aware-Routing Scheme with Use of Two Routing Tables Taking into Account Node Centricity Wataru Ogasa, Yoshio Sugizaki, Koichi Asatani (Kogakuin Univ.) IN2009-89 |
The demands for VoIP communications on the internet are increasing. QoS-aware routing schemes are important for real-tim... [more] | IN2009-89 pp.13-18 |
| ICM | 2009-03-13 12:55 |
Kagoshima | [Encouragement Talk]
Construction of Candidate Topologies for Large-Scale Networks Noriaki Kamiyama (NTT Corp.) ICM2008-77 |
When designing network topology, we need to consider multiple criteria, such as network cost and reliability, simultaneo... [more] | ICM2008-77 pp.111-116 |
|
| IN, NS (Joint) |
2009-03-04 15:20 |
Okinawa | Okinawa-Zanpamisaki Royal Hotel | A New QoS-Aware Routing Scheme with Use of Multiple Routing Tables Naoki Kawahito, Wataru Ogasa, Yoshio Sugizaki, Saneyasu Yamaguchi, Koichi Asatani (Kogakuin Univ.) NS2008-222 |
The demands for VoIP communication is increasing. QoS-aware routing schemes are important for real-time applications suc... [more] | NS2008-222 pp.445-450 |
| SIS | 2008-03-14 14:15 |
Tokyo | Musashi Institute of Technology(Setagaya) | Impulse Noise Reduction of Digital Image by Using Minimum Spanning Tree Go Tanaka, Noriaki Suetake, Eiji Uchino (Yamaguchi Univ.) SIS2007-88 |
A switching median filter is effective in elimination of impulse noises while preserving image edges. In the filter, an ... [more] | SIS2007-88 pp.39-44 |
| COMP | 2007-09-20 13:15 |
Aichi | Approximating the Distribution Function of Minimum Spanning Tree Cost with Normally Disributed Stochastic Edge Weights Ei Ando, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) COMP2007-35 |
Given a graph $G$ of $n$ vertices whose edge weights are random variables and obey mutually independent normal distri... [more] |
COMP2007-35 pp.21-27 |
|
| COMP | 2007-05-25 14:30 |
Fukuoka | Kyushu University | Fixed-Parameter Tractability for Non-Crossing Spanning Trees Magnus Halldorsson (Univ. of Iceland), Christian Knauer (Freie U.), Andreas Spillner (U. East Anglia), Takeshi Tokuyama (Tohoku U) COMP2007-15 |
We consider the problem of computing non-crossing spanning trees in topological graphs. It is known that it is NP-... [more] |
COMP2007-15 pp.25-30 |
| NS, IN | 2005-03-03 10:30 |
Okinawa | Okinawa Zanpa-misaki Royal | A Proposal and evaluation of Extended Kruskal’s algorithm for reducing total tree cost in P2P/P2MP mixed network Masafumi Shimizu, Masaaki Takagi, Seisho Yasukawa (NTT) |
The Multicast MPLS Protocol, which is proposed at the IETF currently, is needed an algorithm for calculating multicast t... [more] | NS2004-240 IN2004-240 pp.217-220 |
[Return to Top Page]