| 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 # | |
| NS, ICM, CQ (Joint) |
2010-11-18 12:45 |
Kyoto | Katsura Campus, Kyoto Univ. | Fixed Point Optimization Methods for Network Bandwidth Allocation Problems with Compoundable Constraints Hideaki Iiduka, Masato Uchida (KIT)  CQ2010-48 |
In this paper, we deal with network bandwidth allocation problems in which the capacity constraints and the compoundab... [more] |
CQ2010-48 pp.1-4 |
| WBS | 2010-10-07 15:55 |
Nara | Naramachi Center | [Special Talk]
Compressed Sensing
-- Basic principle and its applications -- Toshiyuki Tanaka (Kyoto Univ.) WBS2010-25 |
This report reviews an emerging research field called compressed sensing, which has in recent years drawn intense attent... [more] | WBS2010-25 pp.25-30 |
| IBISML, PRMU, IPSJ-CVIM [detail] | 2010-09-05 17:30 |
Fukuoka | Fukuoka Univ. | A Study on Feature Selection Path for High-Dimensional Local Classifiers Ichiro Takeuchi (NIT) PRMU2010-71 IBISML2010-43 |
We study feature selection and weighting problems for local-based classifier. The proposed algorithm is formulated as a ... [more] | PRMU2010-71 IBISML2010-43 pp.105-112 |
| SP | 2010-03-05 14:15 |
Tokyo | Shibaura Inst. of Tech. (Toyosu Campus) | An Estimation Method of Formant/Anti-Formant on delta Transform Region Syunsuke Azuma, Nobuhiro Miki (Future Univ-Hakodate) SP2009-163 |
The formant information on wide-band speech signals is expected to apply for speech synthesis and recognition techniques... [more] | SP2009-163 pp.87-91 |
| NLP | 2009-11-11 16:20 |
Kagoshima | Experimental Evaluation of a Two-Phase Sequential Partial Optimization Algorithm for Convex Quadratic Programming Problems Yuta Kobayashi, Norikazu Takahashi (Kyushu Univ.) NLP2009-97 |
A convex quadratic programming (QP) problem is an optimization problem in which a convex quadratic function is minimized... [more] | NLP2009-97 pp.85-90 |
|
| PRMU | 2009-08-31 14:40 |
Miyagi | Tohoku Univ. | [Special Talk]
Optimization algorithms for sparse regularization and multiple kernel learning and their applications to CV/PR Ryota Tomioka, Taiji Suzuki, Masashi Sugiyama (Univ. of Tokyo.) PRMU2009-63 |
Convex sparse regularization is increasingly becoming recognized as a principled framework for selecting informative fe... [more] |
PRMU2009-63 pp.43-48 |
| IT | 2009-07-24 10:55 |
Osaka | Kwansei Gakuin Univ. (Umeda campus) | A Convex Optimization based Multiuser Detection Algorithm for Synchronous CDMA systems Shingo Ito, Tadashi Wadayama, Ichi Takumi (Nagoya Inst. of Tech.) IT2009-19 |
In this paper, we propose a multiuser detection algorithm for synchronous CDMA systems based on convex optimization. T... [more] |
IT2009-19 pp.79-84 |
| NS, RCS (Joint) |
2009-07-16 09:10 |
Hokkaido | Hokkaido University (Hokkaido) | On Storage Capacity Control Methods for Fault-Tolerant Peer-to-Peer Storage System Hideaki Iiduka, Masato Uchida, Masato Tsuru, Yuji Oie (KIT) NS2009-43 |
To take the fault tolerance for data redundancy into a peer-to-peer storage system network plays an important role as o... [more] |
NS2009-43 pp.1-6 |
| COMP | 2009-04-17 14:05 |
Kyoto | Kyoto Univ. | An Improved Algorithm for Inserting a Highway in a City Metric Based on Qua-siconvex Optimization Matias Korman, Takeshi Tokuyama (Tohoku Univ.) COMP2009-5 |
We introduce an improved algorithm to locate a segment highway such that the maximum city distance between a given set o... [more] | COMP2009-5 pp.29-35 |
| CAS, NLP | 2009-01-23 13:00 |
Miyazaki | On the Global Convergence of a Decomposition Method for General Convex Quadratic Programming Problems Yuta Kobayashi, Norikazu Takahashi (Kyushu Univ.) CAS2008-92 NLP2008-122 |
A convex quadratic programming (QP) problem, which plays important roles in many fields, is an optimization problem to m... [more] | CAS2008-92 NLP2008-122 pp.159-163 |
|
| COMP | 2007-04-26 13:15 |
Kyoto | Katsura Campus, Kyoto University | On Convex Optimization over Base Polytopes Kiyohito Nagano (Univ. of Tokyo) COMP2007-4 |
This note considers convex optimization problems over base polytopes of polymatroids. We show that the decomposition alg... [more] | COMP2007-4 pp.25-31 |
[Return to Top Page]