|
|
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 # |
DE, CEA |
2016-12-01 09:55 |
Tokyo |
|
Automatic Dictionary Construction of Japanese Cooking Terminology using Cooking Recipe Dataset
-- On Calculating Word Distributional Similarity based on Processing History -- Yoko Yamakata (The Univ. of Tokyo), Hidetsugu Nanba (Hiroshima City Univ.), Tomoko Ohsuga (NII), Jun Harashima (Cookpad Inc.), Yasuhiro Tajima (Okayama Pref. Univ.), Shinsuke Mori (Kyoto Univ.), Keizo Oyama (NII) DE2016-23 |
[more] |
DE2016-23 pp.13-18 |
NLC |
2012-08-30 17:15 |
Kanagawa |
Fuji Xerox |
Emotion estimation of commentary tweets Yasuhiro Tajima (OPU) NLC2012-16 |
We propose estimation performances about emotion of tweets attached to web news articles.
The estimation mathod is a n... [more] |
NLC2012-16 pp.37-40 |
NLC, TL |
2011-10-10 16:10 |
Okayama |
Bldg. of Graduate School NST Okayama Univ. |
A text segmentation method via continuous HMM Yasuhiro Tajima (OPU) TL2011-30 NLC2011-27 |
A text segmentation method via continuous HMM is shown in this paper.
In general, an HMM has output symbols of vocublar... [more] |
TL2011-30 NLC2011-27 pp.27-31 |
COMP |
2009-09-14 13:35 |
Tottori |
Tottori University of Environmental Studies |
Parameter acquisition of an evaluation function for games by reinforcement learning Yasuhiro Tajima (Okayama Pref Univ.) COMP2009-28 |
On finite two-person zero-sum perfect-information games, we can find the best move by minmax search
on the game tree wi... [more] |
COMP2009-28 pp.21-26 |
COMP |
2009-03-02 14:50 |
Tokyo |
Tokyo Institute of Technology |
Polynomial Time Probabilistic Learning of a Subclass of Linear Languages with Queries Yasuhiro Tajima, Yoshiyuki Kotani (Tokyo Univ. of Agri. & Tech.) COMP2008-60 |
We show a probabilistic learnability of a subclass of linear languages with queries. Learning via queries
is an importa... [more] |
COMP2008-60 pp.41-47 |
COMP |
2005-10-19 11:35 |
Miyagi |
Tohoku Univ. |
Some sufficient conditions to solve the learning problem of simple deterministic languages from queries and counterexamples Yasuhiro Tajima, Yoshiyuki Kotani (Tokyo Univ. of Agri and Tech.), Etsuji Tomita (Univ. of Electro-Comm.) |
It is unknown that polynomial time learnability of simple deterministic languages from membership
queries and counterex... [more] |
COMP2005-48 pp.25-30 |
|
|
|
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]
|