|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
EA, SP, SIP |
2016-03-29 09:00 |
Oita |
Beppu International Convention Center B-ConPlaza |
[Poster Presentation]
Amplitude limiters based on phase optimization Akira Kakitani, Daisuke Saito, Yasuhiro Kosugi, Nobuaki Minematsu (UTokyo) EA2015-111 SIP2015-160 SP2015-139 |
In order to reduce the peak value of source waveforms without quality degradation, a novel method is proposed. In this m... [more] |
EA2015-111 SIP2015-160 SP2015-139 pp.249-254 |
NLP |
2012-07-06 10:45 |
Kagoshima |
Kagoshima Sangyou Hall |
Global Convergence of a Modified Multiplicative Update Algorithm for Convex Quadratic Programming Problems with Nonnegativity Constraints Jiro Katayama, Norikazu Takahashi (Kyushu Univ.) NLP2012-50 |
We consider problems of minimizing a convex quadratic function under
nonnegativity constraints. Sha {\it et al.} propos... [more] |
NLP2012-50 pp.69-73 |
IBISML |
2010-11-05 15:30 |
Tokyo |
IIS, Univ. of Tokyo |
[Poster Presentation]
A Study on the Suboptimal Solution Path Algorithm Masayuki Karasuyama, Ichiro Takeuchi (NIT) IBISML2010-89 |
The solution path algorithms in machine learning trace the exact optimal solutions by exploiting the piecewise linearity... [more] |
IBISML2010-89 pp.221-230 |
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 |
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 |
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 |
|
|
|
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]
|