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 - 40 of 47 [Previous]  /  [Next]  
Committee Date Time Place Paper Title / Authors Abstract Paper #
CQ 2014-07-10
11:15
Osaka   Analysis of the Robustness of Degree Centrality against Random Errors in Graphs
Sho Tsugawa (Univ. of Tsukuba), Hiroyuki Ohsaki (Kwansei Gakuin Univ.) CQ2014-18
Network analyses, which analyze the topological structure of large-scale complex networks such as social networks, brain... [more] CQ2014-18
pp.19-24
IBISML 2014-03-07
10:05
Nara Nara Women's University Online Prediction with Bradley-Terry Models and Logistic Models
Issei Matsumoto, Kohei Hatano, Eiji Takimoto (Kyushu Univ) IBISML2013-74
We consider an online density estimation problem under the Bradley-Terry model which determines the probability of the o... [more] IBISML2013-74
pp.55-62
IBISML 2014-03-07
14:45
Nara Nara Women's University Estimation of Item Preference Parameter with User Review Data
Shunichi Mochizuki, Yu Fujimoto, Noboru Murata (Waseda Univ.) IBISML2013-79
There are services that recommend items such as shops or products to users based on scores or ratings that other users h... [more] IBISML2013-79
pp.89-94
VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM
(Joint) [detail]
2013-11-27
10:25
Kagoshima   Fast distance calculation method for rooted tree with CUDA
Hiroki Sakamoto, Yasuhiro Takashima (Univ. of Kitakyushu) VLD2013-62 DC2013-28
In this paper, we propose a fast distance calculation method for the rooted tree with CUDA.
In recent years, GPGPU has ... [more]
VLD2013-62 DC2013-28
pp.7-12
RCS, AP
(Joint)
2013-11-21
10:25
Shimane Matsue Terrsa Non-linear Fast Fading Compensation for HTRCI-MIMO/OFDM with QRM-MLD and Channel Ranking
Yuta Ida (Yamaguchi Univ.), Masanori Yofune (Hiroshima City Univ.), Chang-Jun Ahn (Chiba Univ.), Takahiro Matsumoto, Shinya Matsufuji (Yamaguchi Univ.) RCS2013-186
In multiple-input multiple-output orthogonal frequency division multiplexing (MIMO/OFDM) systems, large complexity is co... [more] RCS2013-186
pp.73-77
IBISML 2013-11-12
15:45
Tokyo Tokyo Institute of Technology, Kuramae-Kaikan [Poster Presentation] Support vector comparison machines
Toby Dylan Hocking, Supaporn Spanurattana, Masashi Sugiyama (Tokyo Inst. of Tech.) IBISML2013-51
In ranking problems, the goal is to learn a ranking function
$r(x)inRR$ from labeled pairs $x,x'$ of input points. In... [more]
IBISML2013-51
pp.115-121
PRMU 2013-02-22
16:40
Osaka   Large-scale Web Video Shot Ranking Exploiting Visual Features and Tag Co-occurrence
Do Hang Nga, Keiji Yanai (Univ. of Electro- Comm.) PRMU2012-176
In this paper, we propose a novel ranking method which aims to detect automatically relevant Web video shots of speci c ... [more] PRMU2012-176
pp.221-226
DE 2012-12-13
14:00
Kyoto Campus Plaza Kyoto A study of online novel ranking based on collective intelligence
Kazunori Shimizu, Eisuke Ito, Sachio Hirokawa (Kyushu Univ.) DE2012-33
A large number of novels are being uploaded as online novels.
The present paper proposes a ranking algorithm based on
... [more]
DE2012-33
pp.107-112
IBISML 2012-11-07
15:30
Tokyo Bunkyo School Building, Tokyo Campus, Tsukuba Univ. Privacy Breach and Differential Privacy of Similarity Search
Hiromi Arai (RIKEN), Jun Sakuma (Univ. of Tsukuba) IBISML2012-60
We examine the database privacy of similarity based ranking for a database of private records where each record and quer... [more] IBISML2012-60
pp.185-192
IN 2012-01-26
14:55
Hokkaido Asahikawa-Terminal-Hotel On the Robustness of Centrality Measures against Link Weight Quantization in Social Network Analysis
Yukihiro Matsumoto, Sho Tsugawa, Hiroyuki Ohsaki, Makoto Imase (Osaka Univ) IN2011-124
Researches on social network analyses have been actively performed.
In social network analysis, individuals are repres... [more]
IN2011-124
pp.23-28
IBISML 2011-11-09
15:45
Nara Nara Womens Univ. Approximate Reduction from AUC Maximization to 1-norm Soft Margin Optimization
Daiki Suehiro, Kohei Hatano, Eiji Takimoto (Kyushu Univ.) IBISML2011-48
Finding linear classifi ers that maximize AUC scores is important in ranking research. This is naturally
formulated as ... [more]
IBISML2011-48
pp.39-46
IBISML 2011-03-28
15:00
Osaka Nakanoshima Center, Osaka Univ. A Study on Position-based Adaptive Weighting for Ranking SVM
Masayuki Karasuyama, Takuya Hasegawa, Tsukasa Matsuno, Ichiro Takeuchi (Nagoya Inst. of Tech.) IBISML2010-115
This paper presents a novel training algorithm for ranking support vector machine (ranking SVM). The focus is on how to ... [more] IBISML2010-115
pp.77-83
IN, NS
(Joint)
2011-03-04
13:40
Okinawa Okinawa Convention Center A study of optimal metadata ranking for the one content to many metadata model
Yuto Yoshinari, Takamichi Miyata, Katsunori Yamaoka, Yoshinori Sakai (Tokyo Inst. of Tech.) IN2010-189
Information retrieval systems usually provide only one metadata selected from multiple different metadata corresponding ... [more] IN2010-189
pp.271-276
PRMU 2011-02-17
11:00
Saitama   An Extension of Semantic Texton Forests to Multi-Label Problem Using Label Ranking
Takaaki Fukuta, Hironobu Fujiyoshi (Chubu Univ.) PRMU2010-210
A method for multi-label semantic segmentation is proposed.
The proposed method is based on the use of semantic texton... [more]
PRMU2010-210
pp.13-18
IBISML 2010-11-04
15:00
Tokyo IIS, Univ. of Tokyo [Poster Presentation] Learning Evaluation Functions for Shogi Using SVM-based Bipartite Ranking Learning
Daiki Suehiro, Kohei Hatano, Hideo Bannai, Eiji Takimoto, Masayuki Takeda (Kyushu Univ.) IBISML2010-74
Recently, automatic optimization of parameters by applying machine learning methods has become a mainstream approach for... [more] IBISML2010-74
pp.113-118
AP 2010-02-18
13:35
Tokyo Toshiba Design, Trial Manufacturing and Evaluation of the Diversity Antenna achieved by the Muhti-Objective Genetic Algorithm
Takanori Yamashita, Yoshihiko Kuwahara (Shizuoka Univ.) AP2009-192
This report proposes a design scheme of the ISDB-T diversity antenna for the Notebook-PC and the flat panel TV using of ... [more] AP2009-192
pp.47-52
PRMU 2008-12-19
11:45
Kumamoto Kumamoto Univ. Multiclass VisualRank: Image Ranking Method in Clustered Subsets Based on Visual Features
Mitsuru Ambai, Yuichi Yoshida (Denso IT Laboratory, Inc) PRMU2008-178
In this paper, we propose Multiclass VisualRank, a method that expands the idea of VisualRank into more than one categor... [more] PRMU2008-178
pp.183-188
DE 2008-12-01 Tokyo Gakushuin [Poster Presentation] RINCA: Ranking based on Information Needs in conjunction with Click log Analysis
Masaya Murata, Hiroyuki Toda, Yumiko Matsuura, Ryoji Kataoka (NTT Cyber Solutions Laboratories) DE2008-60
Precision at a higher rank in search results is one of the important factors that determines the performance of the sear... [more] DE2008-60
p.19
PRMU, DE 2008-06-20
11:10
Hokkaido Otaru-Shimin-Kaikan Influence of Wikipedia on Search Engine Rankings
Hiroaki Sone, Yasuaki Yoshida, Yu Hirate (Waseda Univ.), Hayato Yamana (Waseda Univ./NII) DE2008-16 PRMU2008-34
Search engines are necessary to find information from the Internet. There is an investigation report that users recogniz... [more] DE2008-16 PRMU2008-34
pp.89-94
DE 2007-07-02
14:20
Miyagi Akiu hot springs (Sendai) Discovering Typical Queries for Web Pages
Yutaka Kabutoya (Kyoto Univ.), Takayuki Yumoto (Univ. of Hyogo), Satoshi Oyama, Katsumi Tanaka (Kyoto Univ.) DE2007-30
Nowadays many users use search engines to find and browse a desirable Web page. Those queries to reach a given page conc... [more] DE2007-30
pp.49-54
 Results 21 - 40 of 47 [Previous]  /  [Next]  
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