| 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 # | |
| AI | 2009-09-25 13:00 |
Kyoto | Kyoto Univ. Clock Tower | [Invited Talk]
Recent Topics on the Stable Matching Problems Shuichi Miyazaki (Kyoto Univ.)  AI2009-12 |
In the stable matching problem, we are given a set of men and women, and each person's preference list that orders membe... [more] | AI2009-12 pp.19-22 |
| COMP | 2009-06-29 14:05 |
Hokkaido | Hokkaido University | Approximating Edit Distance of Unordered Trees of Bounded Height Daiji Fukagawa (NII), Tatsuya Akutsu (Kyoto Univ.), Atsuhiro Takasu (NII) COMP2009-22 |
The edit distance problem on two unordered trees is known to be MAX SNP-hard. In this paper, we present an approximation... [more] | COMP2009-22 pp.31-36 |
| MSS | 2009-01-30 09:30 |
Kanagawa | Kanagawa Industrial Promotion Center | VNS-based Enhancing of a Distributed Branch-and-Bound Algorithm ParaBSC for the Graph Coloring Problem Yukihiro Dougo, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CST2008-52 |
Given an undirected graph $G$, a coloring is an assignment of colors to vertices of $G$ such that any pair of adjacent... [more] |
CST2008-52 pp.61-66 |
| ICM, CQ, NS (Joint) |
2008-11-13 18:50 |
Fukushima | Nihon University | Performance Evaluation for the GI/GI/1 Round-Robin System Kentaro Hoshi, Sumito Iijima, Yoshitaka Takahashi, Naohisa Komatsu (Waseda Univ.) CQ2008-53 |
The round-robin (RR) scheduling algorithm is one of the widely used operating system scheduling algorithms for informati... [more] | CQ2008-53 pp.45-49 |
| COMP | 2008-05-13 11:15 |
Fukuoka | Kyushu Sangyo University | Minimum Energy Broadcasting on Wireless Networks in Manhattan Model Toshinori Yamada (Saitama Univ.) COMP2008-9 |
This paper considers a special case of MECBS(Minimum Energy Consumption Broadcast Subgraph) problem, which is motivate... [more] |
COMP2008-9 pp.9-16 |
| COMP | 2008-05-13 15:20 |
Fukuoka | Kyushu Sangyo University | Improved approximation of the Largest common Sub-tree of Two Unordered Trees of Bounded Height Tatsuya Akutsu (Kyoto Univ.), Daiji Fukagawa, Atsuhiro Takasu (NII) COMP2008-13 |
Finding similarities in tree structured data is important for such areas as computational biology, XML databases and ima... [more] | COMP2008-13 pp.37-42 |
| COMP | 2008-03-10 09:30 |
Kanagawa | Approximation Algorithms for the Sex-Equal Stable Marriage Problem Hiroki Yanagisawa (IBM), Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) COMP2007-55 |
The stable marriage problem is a classical matching problem introduced by Gale and Shapley. It is known that for any i... [more] |
COMP2007-55 pp.1-8 |
|
| COMP | 2008-03-10 14:25 |
Kanagawa | Consistent Digital Rays Jinhee Chun, Matias Korman (Tohoku Univ.), Martin Noellenburg (Karlsruhe Univ.), Takeshi Tokuyama (Tohoku Univ.) COMP2007-61 |
Given a fixed origin $o$ in the $d$-dimensional grid, we give a novel definition of {\em digital rays} $\dig(op)$ from $... [more] | COMP2007-61 pp.39-46 |
|
| COMP | 2008-03-10 14:50 |
Kanagawa | An extention of the auction algorithm for the duty model and its implementation Toru Miyazawa, Yoshinori Takei (Nagaoka Univ. Tech.) COMP2007-62 |
The ability of forecasting the equilibrium price in a market is valuable for both consumers and suppliers because it wou... [more] | COMP2007-62 pp.47-54 |
|
| CAS | 2008-01-31 13:25 |
Okinawa | Enhancing Algorithms for the Graph Coloring Problem Shinji Okada, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2007-85 |
Coloring a given graph $G=(V,E)$ is to assign each vertex $v$ of $V$ a color $c(v)$ such that $c(u)$ is different from $... [more] | CAS2007-85 pp.7-12 |
|
| CAS | 2008-02-01 16:20 |
Okinawa | Performance Comparison of Algorithms for the Minimum Weight Vertex Cover Problem Takuya Kunichika, Satoshi Taoka, Toshimasa Watanabe (Hiroshima Univ.) CAS2007-107 |
A vertex cover of a given graph $G=(V,E)$ is a subset $N$ of $V$ such that $N$ contains either $u$ or $v$ for any edge $... [more] | CAS2007-107 pp.79-84 |
|
| COMP | 2007-03-05 15:35 |
Tokyo | The University of Electro-Communications | Approximation algorithms for the degree 3 terminal steiner tree problem with restricted weights Kazuma Naito (titech) |
The steiner tree problem asks for a smallest tree spanning a given subset $R$ of distinguished vertices. We consider a ... [more] |
COMP2006-57 pp.51-58 |
| PRMU, NLC, TL | 2006-10-20 14:30 |
Tokyo | Simultaneous Low Rank Approximations of Tensors Kohei Inoue, Kiichi Urahama (Kyushu Univ.) |
In this paper, we propose iterative and non-iterative algorithms for simultaneous low rank approximation of tensors (SLR... [more] | PRMU2006-112 pp.47-52 |
|
| COMP | 2006-10-17 11:00 |
Miyagi | Tohoku University | Efficient Algorithms for Airline problem Ryuhei Uehara (JAIST) |
It is known that the airlines in the real world form small-world network. This fact implies that they are constructed w... [more] |
COMP2006-34 pp.25-31 |
| NC | 2006-07-14 13:00 |
Tokyo | Waseda University | Asymptotic Behavior of Free Energy of General Boltzmann Machines in Mean Field Approximation Yu Nishiyama, Sumio Watanabe (T.I.Tech) |
In the Bayesian learning, which generally requires huge computational costs, the algorithms based on the mean field appr... [more] | NC2006-38 pp.1-6 |
| COMP | 2006-03-22 15:05 |
Tokyo | The University of Electro-Communications | Experimental analyses of approximation algorithms for the maximum weighted independent set problem on d-claw free graphs Yota Otachi, Koichi Yamazaki (Gunma Univ.) |
A $d$-claw is an induced subgraph isomorphic to $K_{1,d}$. A graph is $d$-claw free if it has no $d$-claws. Several appr... [more] | COMP2005-60 pp.25-30 |
| PRMU, HIP | 2006-01-20 17:25 |
Osaka | Osaka Univ. | Equivalence between Non-Iterative Algorithms for Simultaneous Low Rank Approximations of Matrices Kohei Inoue, Kiichi Urahama (Kyushu Univ.) |
Recently, four non-iterative algorithms for simultaneous low rank approximations of matrices have been presented by seve... [more] | PRMU2005-178 HIP2005-148 pp.171-176 |
| COMP | 2005-05-20 15:30 |
Fukuoka | Kyushu Univ. | Improving a local search approximation algorithm for the stable marriage problem Naoya Yamauchi, Shuichi Miyazaki, Kazuo Iwama (Kyoto Univ.) |
We consider the problem of finding a stable matching of maximum size when both ties and unacceptable partners are allowe... [more] | COMP2005-15 pp.45-51 |
| COMP | 2005-03-18 14:10 |
Tokyo | Tokyo Institute of Technology | Algorithms for Finding Distance-Edge-Colorings of Graphs Takehiro Ito, Akira Kato, Xiao Zhou, Takao Nishizeki (Tohoku Univ.) |
For a given bounded nonnegative integer $\ell$, we wish to color all edges of a graph $G$ so that any two edges within d... [more] | COMP2004-79 pp.49-55 |
| COMP | 2005-01-28 15:20 |
Aichi | Nagoya University | Algorithms and Implementation of Peak-Reducing Fitting of a Curve Masato Yuki, Jinhee Chun (Tohoku Univ.), Kunihiko Sadakane (Kyushu Univ.), Takeshi Tokuyama (Tohoku Univ.) |
The problem of approximating complexity curves is basic operation for processing of geometry data. In this paper, we emp... [more] | COMP2004-70 pp.83-89 |
[Return to Top Page]