| 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 | 2013-06-24 13:20 |
Nara | Nara Women's University | [Tutorial Lecture]
Introduction to Computational Complexity Theory (3): Mathematical Programming Approaches to the Limitations of Computation Kenya Ueno (Kyoto Univ.)  COMP2013-22 |
This presentation corresponds to the third tutorial of the ELC (Exploring the Limits of Computation) project supported b... [more] | COMP2013-22 p.21 |
| COMP | 2012-12-10 10:55 |
Fukuoka | Kyushu University | Iterative rounding approximation algorithms for degree-bounded node-connectivity network design Takuro Fukunaga (Kyoto Univ.) COMP2012-45 |
We consider the problem of finding a minimum edge cost subgraph of an undirected or a directed graph satisfying given co... [more] | COMP2012-45 pp.15-22 |
| COMP | 2012-12-10 17:15 |
Fukuoka | Kyushu University | Comparison of Worst-case Polytopes for the Simplex Method
-- Klee-Minty Cubes Are Also Goldfarb Cubes -- Bernd G aertner, Christian Helbling (ETH Zurich), Yoshiki Ota, Takeru Takahashi (Tohoku Univ.) COMP2012-51 |
The $d$-dimensional Goldfarb cube is a polytope with the property that all its $2^d$ vertices appear on some shadow of i... [more] | COMP2012-51 pp.49-53 |
| IBISML | 2012-11-08 15:00 |
Tokyo | Bunkyo School Building, Tokyo Campus, Tsukuba Univ. | Path following approach for efficient reweighted L1 minimization Yuki Shinmura, Ichiro Takeuchi (NIT) IBISML2012-71 |
The problem of recovering sparse signals is an important topic in machine learning and compressed sensing literatures. ... [more] |
IBISML2012-71 pp.265-270 |
| IN, NS, CS (Joint) |
2012-09-21 10:40 |
Miyagi | Tohoku Univ. Research Institute of Electrical Communication 2gokan | [Encouragement Talk]
Dynamic Transmission Route Selection Toward the Contents Transmission Energy Optimization in E3-DCN Naohiko Shibuta, Shanming Zhang, Hidetoshi Takeshita, Satoru Okamoto (Keio Univ.), Eiji Oki (UEC), Naoaki Yamanaka (Keio Univ.) NS2012-70 |
We previously proposed Energy Efficient and Enhanced-type DCN(${\rm E}^3$-DCN) which includes mash-up service and Data C... [more] | NS2012-70 pp.99-104 |
| IN | 2012-01-27 14:30 |
Hokkaido | Asahikawa-Terminal-Hotel | A study on QoS-aware path provisioning control in MPLS network Yukitaka Yoshida, Masatoshi Kawarasaki (Tsukuba Univ.) IN2011-134 |
If IP network only uses conventional routing protocols such as open shortest path first (OSPF), some portions of the net... [more] | IN2011-134 pp.83-88 |
| SS, MSS | 2012-01-27 10:45 |
Kochi | Kochi City Culture-Plaza Cul-Port | Control of Uncertain Networked Systems with Multiple Random Delays Koichi Kobayashi, Kunihiko Hiraishi (JAIST) MSS2011-69 SS2011-54 |
In networked systems, there exist multiple delays such as input delays, output delays, and delays occurred by packet los... [more] | MSS2011-69 SS2011-54 pp.85-88 |
| IT | 2012-01-20 14:05 |
Ibaraki | University of Tsukuba | A note on novel permutation codes based on pure involution codes Kazuhiro Fuwa, Tadashi Wadayama (NIT) IT2011-39 |
In this paper, we propose a novel class of permutation codes based on pure involution codes. Pure involution code is a ... [more] |
IT2011-39 pp.1-6 |
| NS, RCS (Joint) |
2011-12-16 10:00 |
Yamaguchi | Yamaguchi University | Service composition system optimized network and service resources in E3-DCN Naohiko Shibuta, Kenta Nakahara, Kou Kikuta, Daisuke Ishii, Satoru Okamoto (Keio Univ.), Eiji Oki (U.E.C.), Naoaki Yamanaka (Keio Univ.) NS2011-138 |
We previously presented Ubiquitous Grid Networking Environment (uGrid). In uGrid, everything on the network such as dev... [more] |
NS2011-138 pp.115-120 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2011-11-29 13:25 |
Miyazaki | NewWelCity Miyazaki | An Integer Linear Programming based Multiple Task Allocation Method for Fault Tolerance in Network on Chip Hiroshi Saito (Univ. Aizu), Tomohiro Yoneda (NII), Yuichi Nakamura (NEC) VLD2011-77 DC2011-53 |
This paper proposes a multiple task allocation method for given NoC model, task graph, and the number of expected failur... [more] | VLD2011-77 DC2011-53 pp.147-152 |
| SIS | 2011-06-09 11:00 |
Okinawa | Ishigaki Health & Wellness Center | A Study on Detection Accuracy for Intruder Detection System Using Leaky Coaxial Cable Tomonori Sato, Minoru Okada (NAIST) SIS2011-4 |
Recently, there has been an increasing demand for wide-area intruder detection systems for security purposes. LCX(Leaky... [more] |
SIS2011-4 pp.15-20 |
| PN | 2011-02-28 14:00 |
Kagoshima | KKR Kagoshima Keitenkaku | [Encouragement Talk]
Hierarchical Optical Path Network Design with Wavelength/Waveband Conversion based on Two-Stage ILP Formulation Kazuteru Nakano, Yoshiyuki Yamada, Hiroshi Hasegawa, Ken-ichi Sato (Nagoya Univ.) PN2010-63 |
In this paper, we propose design algorithms for hierarchical optical path networks with waveband/wavelength conversion o... [more] | PN2010-63 pp.41-44 |
| IT | 2011-01-18 14:50 |
Nara | A Note on the Inference Algorithm on the Factor Graph based on the Linear Programming Shunsuke Horii, Toshiyasu Matsushima (Waseda Univ.), Shigeichi Hirasawa (Waseda Univ./Cyber Univ.) IT2010-63 |
Probabilistic inference problem on the graphical model is very important since it is arising in many applications which ... [more] | IT2010-63 pp.55-60 |
|
| IBISML | 2010-11-04 15:00 |
Tokyo | IIS, Univ. of Tokyo | [Poster Presentation]
A Study on Simultaneous Feature Selection for Cost-Sensitive Classifiers Using Mixed-Norm Regularization Toru Sugiura, Kazuaki Koide, Tatsuya Hongo, Masayuki Karasuyama, Ichiro Takeuchi (NIT) IBISML2010-70 |
Cost-sensitive learning is useful for binary classification when the costs of miss-classifications are not symmetric. I... [more] |
IBISML2010-70 pp.83-90 |
| IT | 2010-09-21 17:15 |
Miyagi | Tohoku Gakuin University | An Improvement of Adaptive Cutting Plane Method for Linear Programming Decoding of Binary Linear Codes Jun Muramatsu (NTT) IT2010-40 |
An maximum-likelihood decoding algorithm for a linear code is introduced. It is based on the linear programming method i... [more] | IT2010-40 pp.37-42 |
| NS | 2010-04-16 09:00 |
Kagoshima | Kagoshima Univ. | Bandwidth Design Method Considering Failures in IP Network Ryuta Sugiyama, Tomonori Takeda, Yoshihiko Uematsu, Kohei Shiomoto (NTT) NS2010-9 |
This paper proposes a bandwidth design method considering failures in an IP network. When we design the link bandwidth, ... [more] | NS2010-9 pp.43-46 |
| PN | 2010-03-08 11:15 |
Okinawa | Ohama Nobumoto Memorial Hall | Hierarchical Optical Path Network Design Considering Wavelength/Waveband Conversion Kazuteru Nakano, Yoshiyuki Yamada, Hiroshi Hasegawa, Ken-ichi Sato (Nagoya Univ.) PN2009-89 |
In this paper, we propose design algorithms for hierarchical optical path networks with waveband/wavelength conversion o... [more] | PN2009-89 pp.19-24 |
| R | 2009-10-16 13:20 |
Fukuoka | Kyutech Plaza@Tenjin of Kyushu Institute of Technology | Improvement of Error Estimation Method of Flowmeters Considering Results of Failure Diagnosis Based on Control Limits Shinichi Komatsu, Naoki Kimura, Yoshifumi Tsuge (Kyushu Univ.) R2009-33 |
The failure diagnosis method of flowmeters based on control limits is useful to detect flowmeters whose probability of f... [more] | R2009-33 pp.1-5 |
| COMP | 2009-10-16 16:00 |
Miyagi | Tohoku University | Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds Kenya Ueno (Univ. of Tokyo) COMP2009-38 |
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectang... [more] | COMP2009-38 pp.41-48 |
| ICM | 2009-03-13 13:15 |
Kagoshima | Bandwidth Capacity Design under Incomplete Traffic Information
-- Formulation on Linear Programming and its Evaluation -- Ryutaro Matsumura, Masayuki Tsujino, Motoi Iwashita (NTT Corp.) ICM2008-78 |
The information of the end-to-end traffic flows between source nodes and destination nodes on networks is essential to c... [more] | ICM2008-78 pp.117-120 |
|
[Return to Top Page]