| 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 | 2023-05-11 15:25 |
Hokkaido | Hokkaido University | Parameterized Complexity of Shortest Path Most Vital Edges Problem Yuto Ashida, Naoki Kitamura, Taisuke Izumi, Toshimitsu Masuzawa (Osaka Univ.)  COMP2023-6 |
Given an undirected graph $G$, vertices $s,t$ of $G$,and the number of removal edges $d$,the shortest paths most vital e... [more] | COMP2023-6 pp.29-35 |
| DE, IPSJ-DBS | 2021-12-27 10:50 |
Online | (Primary: Online, Secondary: On-site) |
Tree decomposition compression using tree grammar and query processing based on answer set programming Kazuyuki Kojima, Hiroyuki Seki (Nagoya Univ.) DE2021-16 |
Tree decomposition of a graph is an effective approach to solving problems for large graphs while the decomposition itse... [more] | DE2021-16 pp.7-12 |
| IBISML | 2018-03-05 13:50 |
Fukuoka | Nishijin Plaza, Kyushu University | Metric Learning for k-Nearest Neighbor Estimation using Multiple Distance Metrics Yokuto Seki, Noboru Murata (Waseda Univ.) IBISML2017-92 |
The relationship between unstructured datasets such as graphs can be measured by multiple distance metrics. In this pap... [more] |
IBISML2017-92 pp.15-19 |
| COMP | 2018-03-05 15:30 |
Osaka | Osaka Prefecture Univ. | Efficient Computation of Betweenness Centrality by Graph Decompositions and their Applications to Real-world Networks Tatsuya Inoha (Osaka Pref. Univ.), Kunihiko Sadakane (Univ. of Tokyo), Yushi Uno (Osaka Pref. Univ.), Yuuma Yonebayashi (Univ. of Tokyo) COMP2017-51 |
Betweenness centrality is one of the most significant and commonly used centralities which is a notion of measuring the ... [more] | COMP2017-51 pp.35-42 |
| COMP | 2017-03-07 11:30 |
Aichi | Nanzan University | Extension of the Vertex Cover Problem to the Size-t Cycle Cover Problems Batchunag Dashdemberel, Osamu Watanabe (Tokyo Tech.) COMP2016-52 |
We consider an extension of the Vertex Cover (VC) problem. For a given graph, its (edge) vertex cover (in short, VC) i... [more] |
COMP2016-52 pp.11-18 |
| PRMU | 2013-02-22 10:00 |
Osaka | Grafting Trees A Nearest Neighbor Srarch Algorithm without Distance Computation Yohei Ohtani, Toshikazu Wada, Hiroshi Oike (Wakayama Univ.) PRMU2012-162 |
This report presents a nearest neighbor search algorithm without distance computation. K-D tree based nearest neighbor s... [more] | PRMU2012-162 pp.137-142 |
|
| 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 |
|
| MSS | 2011-01-21 13:35 |
Yamaguchi | Kaikyo-Messe-Shimonoseki | Proposal of an Improved Algorithm for Finding Kernel Set and a New Method Yuki Ikeda, Yasuto Aihara, Qi-Wei Ge, Mitsuru Nakata (Yamaguchi Univ.) CST2010-75 |
In this paper, we propose an improved algorithm for finding kernel set and further propose a new method by using Tree-de... [more] | CST2010-75 pp.87-92 |
| VLD, CAS, SIP | 2008-06-27 15:05 |
Hokkaido | Hokkaido Univ. | Novel Characteristics of Even-Stacked Cosine-Modulated Filter Banks
-- Alternative M-band Dual-Tree Wavelet Transform, Directionality, Shift-Invariance -- Seisuke Kyochi, Masaaki Ikehara (Keio Univ.) CAS2008-32 VLD2008-45 SIP2008-66 |
In this paper, we show novel characteristics of even-stacked cosine-modulated filter banks (ECFBs)which have been propos... [more] | CAS2008-32 VLD2008-45 SIP2008-66 pp.79-84 |
| WBS | 2005-10-27 13:30 |
Shizuoka | Shizuoka University (Hamamatsu Campus) | A study on comparison between Successive Detection scheme based on ML criterion using M algorithm and QRD-M algorithm in down-link MC-CDMA System Yoshihito Morishige, Masahiro Fujii, Makoto Itami, Kohji Itoh (TUS) |
It is well known that ML detection is the optimum multiuser detection in the sense of minimizing the probability of th... [more] |
WBS2005-32 pp.1-6 |
[Return to Top Page]