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 21 - 40 of 59 [Previous]  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
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
COMP 2015-03-09
16:00
Kyoto Ritsumeikan University On a 2-approximation Self-stabilizing Algorithm for the Maximum Leaf Spanning Tree
Keisuke Okamoto, Yoshiaki Katayama (NIT) COMP2014-50
The maximum leaf spanning tree (MLST) is a spanning tree that has the largest possible number of leaves among all spanni... [more] COMP2014-50
pp.53-60
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
COMP 2014-03-10
15:05
Tokyo   Safely-converging self-organization of a BFS tree with many leaves in virtual grid networks
Shusuke Takatsu, Fukuhito Ooshita, Hirotsugu Kakugawa, Toshimitsu Masuzawa (Osaka Univ) COMP2013-70
We propose a safely-converging self-organization of a Breadth-First-Search spanning tree (BFS tree) with many leaves in ... [more] COMP2013-70
pp.69-76
EA 2013-12-14
13:25
Ishikawa Satellite Plaza of Kanazawa University Sound image direction control by dynamic amplitude panning
Tomohiro Momose, Makoto Otani, Masami Hashimoto, Mizue Kayama, Kazunori Itoh (Shinshu Univ.) EA2013-98
Stereo reproduction is commonly used to present audio information to a listener and to control a sound image position us... [more] EA2013-98
pp.61-66
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
EA 2013-03-12
15:20
Saitama KDDI R&D Laboratories Audio-visual experiment for 3D audio system using multiple vertical panning
Toshiyuki Kimura, Hiroshi Ando (NICT) EA2012-148
In this paper, in order to evaluate the audio-visual performance of the proposed three-dimensional (3D) audio system, wh... [more] EA2012-148
pp.43-48
EA 2012-03-16
11:30
Tokyo Central Research Laboratory, Hitachi, Ltd. Listening Test for 3D Audio System Using Multiple Vertical Panning
Toshiyuki Kimura, Hiroshi Ando (NICT) EA2011-122
In this paper, the novel three-dimensional (3D) audio system is proposed. The proposed system is based on Multiple Verti... [more] EA2011-122
pp.13-18
MoNA, AN, USN
(Joint)
2012-01-19
13:20
Mie Todaya (Toba) Examination of reconstruction method in wirelessmesh network usingVLAN spanning trees and virtual trunk nodes
Issei Yajima, Hiroaki Morino (Shibaura Inst of Tec) AN2011-62
Wireless mesh networksrouting control is proposed which quikly reconstructs trees for link break among each node using V... [more] AN2011-62
pp.43-48
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
NS 2011-10-13
10:25
Aichi Nagoya Institute of Technology Loop-free Fast Rerouting technique considering multiple failures
Shohei Kamamura (Waseda Univ./NTT), Daisaku Shimazaki, Atsushi Hiramatsu (NTT), Hidenori Nakazato (Waseda Univ.) NS2011-83
A spanning tree rerouting (STR) method has been proposed for achieving IP layer fast recovery. However, existing work on... [more] NS2011-83
pp.7-12
COMP 2011-03-09
13:35
Tokyo Chuo Univ. Evaluation of metaheuristic algorithms for Spanning Tree Congestion
Daiki Maruta (Gunma Univ.), Yota Otachi (Tohoku Univ.), Koichi Yamazaki (Gunma Univ.) COMP2010-50
Spanning tree congestion (STC) is a graph parameter
which has been well studied recently.
This work is to compare the... [more]
COMP2010-50
pp.25-28
IN 2011-01-21
13:25
Osaka Osaka Univ. Energy Efficient Methods in Layer-2 Switches
Yuji Ogawa, Kazuki Hamada, Kazuyuki Kashima, Eiichi Horiuchi (Mitsubishi Electric) IN2010-134
For a “low-carbon path”, energy efficient methods is needed in Internetwork or Intranetwork. In this report, we propose ... [more] IN2010-134
pp.91-96
EA, US
(Joint)
2011-01-21
14:45
Kyoto Doshisha Univ. A study on sound localization by stereo earphones with regard to stereo aperture angles and bandwidths
Keishiro Furumoto, Haruhide Hokari, Shoji Shimada (Nagaoka Univ. of Tech.) EA2010-122
We examine the significant difference in auditory sound localization yielded by stereo speaker listening and stereo earp... [more] EA2010-122
pp.101-106
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
COMP, IPSJ-AL 2010-05-19
16:30
Ishikawa Japan Advanced Institute of Science and Technology Spanning tree congestion of k-outerplanar graphs
Hans L. Bodlaender (Utrecht Univ.), Kyohei Kozawa (J-POWER), Takayoshi Matsushima (Gunma Univ.), Yota Otachi (Tohoku Univ.) COMP2010-14
In 1987, Simonson [Math. Syst. Theory 20 (1987) 235-252] conjectured that every k-outerplanar graph of the maximum degre... [more] COMP2010-14
pp.43-46
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
NS, IN
(Joint)
2010-03-04
11:10
Miyazaki Miyazaki Phoenix Seagaia Resort (Miyazaki) Fast Rerouting Method in Layer-2 Switches
Kazuki Hamada, Katsuyoshi Takahashi, Kazuyuki Kashima (Mitsubishi Electric Corp.) IN2009-151
In layer-2 networks, spanning tree protocols (STP, RSTP, and MSTP) are the most popular methods to get redundancy and to... [more] IN2009-151
pp.43-48
COMP 2010-01-25
10:05
Fukuoka Nishijin Plaza, Kyushu University Complexity results for the spanning tree congestion problem
Yota Otachi (Gunma Univ.), Hans L. Bodlaender (Utrecht Univ.) COMP2009-40
We study the computational complexity of determining the \emph{spanning tree congestion} of a graph. First, we show that... [more] COMP2009-40
pp.9-16
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
 Results 21 - 40 of 59 [Previous]  /  [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