IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 21 - 30 of 30 [Previous]  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
ISEC, IT, WBS 2015-03-02
16:40		 Fukuoka The University of Kitakyushu Algorithms to reduce the number of output symbols on condition that discrete memoryless channel satisfies admissible mutual information
Takumi Nagahara, Yuta Sakai, Ken-ichi Iwata (Univ. of Fukui) IT2014-86 ISEC2014-99 WBS2014-78		 Some quantization techniques are used in channel coding system to reduce the complexity of coding problem.
Kurkoski and... [more]		 IT2014-86 ISEC2014-99 WBS2014-78
pp.153-158
IT 2014-07-18
14:25		 Hyogo Kobe University On Quantization by Greedy Combining for Outputs of Discrete Memoryless Channels
Yuta Sakai, Ken-ichi Iwata (Univ. of Fukui) IT2014-34		 Some quantization techniques are used in practice system to reduce the complexity of coding problem.
Kurkoski and Yagi ... [more]		 IT2014-34
pp.127-132
IBISML 2014-03-07
16:20		 Nara Nara Women's University Binary Principal Points Based on Subgradient Method and Its Application
Haruka Yamashita (Keio Univ.), Yoshinobu Kawahara (Osaka Univ.) IBISML2013-82		 Analysis with Principal Points is a useful statistical tool for summarizing large data. Principal Points is defined as s... [more] IBISML2013-82
pp.109-115
AP 2014-01-23
09:55		 Kagoshima Hozan Hall (Kagoshima Prefectural Culture Center) A Consideration of Transmitting Antenna Selection with Greedy Algorithm in MU-MIMO System
Yohei Sekiya, Nobuyoshi Kikuma, Hiroshi Hirayama, Kunio Sakakibara (Nagoya Inst. of Tech.) AP2013-148		 Multi-user MIMO (MU-MIMO) technology has attracted much attention because of allowing a base station to communicate with... [more] AP2013-148
pp.81-86
COMP 2013-12-21
11:25		 Okinawa Okinawa Industry Support Center Efficient Algorithms for Sorting $k$-Sets in Bins
Kazuhisa Seto (Seikei Univ.), Junichi Teruyama (NII), Atsuki Nagao (Kyoto Univ.) COMP2013-52		 We give efficient algorithms for Sorting $k$-Sets in Bins.
The Sorting $k$-Sets in Bins problem can be described as f... [more]		 COMP2013-52
pp.81-85
COMP 2013-12-21
16:05		 Okinawa Okinawa Industry Support Center Approximability of graph orientation problems with degree constraints
Yuichi Asahiro (Kyushu Sangyo Univ.), Jesper Jansson (Kyoto Univ.), Eiji Miyano (Kyushu Institute of Technology), Hirotaka Ono (Kyushu Univ.) COMP2013-58		 A degree-constrained graph orientation of an undirected graph is an assignment of a direction to each
edge in the graph... [more]		 COMP2013-58
pp.123-130
IBISML 2010-11-04
15:00		 Tokyo IIS, Univ. of Tokyo [Poster Presentation] Efficient Implementation of Greedy Cover Learning by Hyper-Rectangles and Its Classification Performance Evaluation Using Real Data
Koji Ouchi, Atsuyoshi Nakamura, Mineichi Kudo (Hokkaido Univ.) IBISML2010-72		 Blumer et al. showed that
the class of concepts represented by finite unions
of hyper-rectangles
in $d$-dimensional ... [more]		 IBISML2010-72
pp.99-104
CAS 2010-01-29
09:50		 Kyoto Kyoudai-Kaikan Bldg. Effects of Perturbations in Rao's Rectilinear Steiner Arborescence Algorithm
Takuya Yamada, Toshihiko Takahashi (Niigata Univ.), Yoshiaki Abe (Canon Imaging Systems) CAS2009-74		 Minimum rectilinear Steiner arborescence problem (MRSA) is to find an rectilinear Steiner arborescence (RSA) rooted at t... [more] CAS2009-74
pp.61-64
IN, NS
(Joint)		 2009-03-04
15:40		 Okinawa Okinawa-Zanpamisaki Royal Hotel Link Structure Method Considering Extendability for Wireless Mesh Networks
Takeshi Yoshizawa, Yoshifumi Hoda, Takumi Miyoshi (Shibaura Inst. of Tech.), Chihiro Hirata, Shiro Futaki, Hirobumi Watanabe (Inter Energy) NS2008-203		 Wireless mesh networks (WMNs) can expand the communication range of terminals by wireless connected Access Points (APs).... [more] NS2008-203
pp.337-342
IT 2004-07-28
15:55		 Chiba Tokyo Univ. (Kashiwa) Performance Evaluation of Data Compression Algorithms Based on the Greedy Grammar Transform
Naoki Koizumi, Hiroki Koga (Univ. of Tsukuba) 		The universal data compression algorithm based on the greedy-grammar
transform, which was proposed by Yang and Kieffer,... [more]		 IT2004-13
pp.29-34
 Results 21 - 30 of 30 [Previous]  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
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]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan