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 1 - 5 of 5  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
IT 2010-07-22
15:35		 Tokyo Kogakuin University An Almost Sure Convergence Proof of the Average Length of Minimal Forbidden Words on a Stationary Ergodic Source
Takahiro Ota (NPIT), Hiroyoshi Morita (Univ. of Electro-Comm.) IT2010-20		 An antidictionary is in particular useful for data compression, and it consists of minimal forbidden words for a given s... [more] IT2010-20
pp.51-56
WBS, IT, ISEC 2009-03-10
10:15		 Hokkaido Hakodate Mirai Univ. Adaptive Antidictionary Data Compression Using a Set of Restricted Length of Minimal Forbidden Words
Takahiro Ota (Nagano Prefectural Inst. of Tech.), Hiroyoshi Morita (Univ. of Electro-Commu.) IT2008-99 ISEC2008-157 WBS2008-112		 An antidictionary is the set of all minimal strings, called Minimal Forbidden Words (MFWs), which never appear in an inp... [more] IT2008-99 ISEC2008-157 WBS2008-112
pp.363-370
IT 2008-10-07
15:50		 Tochigi Asaya Hotel(Kinugawa Onsen) [Invited Talk] Practical Lossless Source Coding Which Achieves the Entropy Rate -- Focused on Recent Topics on Statistical Modeling for Arithmetic Codes --
Hiroyoshi Morita (Univ. Electro-Commun.) IT2008-41		 Arithmetic coding in the development of source coding brought a big change in how to build a probabilistic model for sou... [more] IT2008-41
pp.13-22
CAS, NLP 2007-10-18
10:30		 Tokyo Musashi Institute of Technology Branch Prediction Based on Antidictionary Tree
Mikihiko Nishiara (Shinshu Univ.), Hiroyoshi Morita (UEC), Takahiro Ota (PIT-Nagano) CAS2007-38 NLP2007-66		 It is necessary to predict by high accuracy the results of the branch commands so as not to obstruct the speed-up of mic... [more] CAS2007-38 NLP2007-66
pp.21-24
IT 2005-07-22
10:50		 Osaka Osaka Prefecture Univ. Construction Antidictionary of a Binary String Using Suffix Tree
Takahiro Ota (PIT Nagano), Hiroyoshi Morita (UEC) 		An antidictionary is a set of shortest words that never appear in a binary string. To construct the antidictionary for a... [more] IT2005-43
pp.9-14
 Results 1 - 5 of 5  /   
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