| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| SIP | 2015-08-20 13:25 |
Tokyo | National Institute of informatics | [Invited Talk]
Introduction of TRECVID Instance Search Task and NII Approach Shin'ichi Satoh (NII)  SIP2015-60 |
Object retrieval in images and videos, especially instance search, is intended to retrieve specific objects such as comm... [more] | SIP2015-60 p.49 |
| PRMU, BioX | 2015-03-20 17:10 |
Kanagawa | Specific object search based on result re-ranking using region-of-interest information Masaya Murata, Hidehisa Nagano, Takahito Kawanishi, Kaoru Hiramatsu, Kunio Kashino (NTT) BioX2014-80 PRMU2014-200 |
In this paper we first explain our retrieval approach for the specific object search task based on image queries. We the... [more] | BioX2014-80 PRMU2014-200 pp.245-249 |
|
| NLC | 2015-02-05 12:10 |
Osaka | T.O.G | Class-Instance Acquisition using Automatically Extracted Hyponymy Relations Ichiro Yamada, Taro Miyazaki, Masaru Miyazaki, Kikuka Miura, Atsushi Matsui, Hideki Tanaka (NHK) NLC2014-44 |
Class-instance relation is useful for information extraction from large volume of text. For example, we can determine wh... [more] | NLC2014-44 pp.1-6 |
| IPSJ-SLDM, CPSY, RECONF, VLD [detail] | 2014-01-28 08:55 |
Kanagawa | Hiyoshi Campus, Keio University | A Unified Software/Reconfigurable Hardware Approach to Solving the Maximum Clique Problem of Large Graphs Chikako Miura, Shinobu Nagayama, Shin'ichi Wakabayashi, Masato Inagi (Hiroshima City Univ.) VLD2013-103 CPSY2013-74 RECONF2013-57 |
We propose an algorithm to solve the maximum clique problem of large graphs. The proposed algorithm is a unified softwar... [more] | VLD2013-103 CPSY2013-74 RECONF2013-57 pp.7-12 |
| PRMU, IPSJ-CVIM, MVE [detail] | 2014-01-24 09:40 |
Osaka | Instance Search with Exponential BM25 Masaya Murata, Hidehisa Nagano, Kunio Kashino (NTT), Shin'ichi Satoh (NII) PRMU2013-111 MVE2013-52 |
We propose a basic video retrieval and ranking method for instance search task. The task requires a system to search vid... [more] | PRMU2013-111 MVE2013-52 pp.189-194 |
|
| PRMU | 2013-02-22 16:10 |
Osaka | Instance Video Search by Images as a Query Masaya Murata, Hidehisa Nagano, Ryo Mukai, Kunio Kashino (NTT), Shin'ichi Satoh (NII) PRMU2012-175 |
We propose a basic video retrieval method for a instance search task for which the system is required for searching vide... [more] | PRMU2012-175 pp.215-219 |
|
| MSS | 2013-01-22 14:50 |
Osaka | Osaka Int. Convention Center | On Analysis on Reachability to Unsafe Markings in Free Choice Workflow Nets Yuki Murakami, Ichiro Toyoshima, Shingo Yamaguchi (Yamaguchi Univ.) MSS2012-49 |
In the Free Choice Workflow net, the marking always reach to non-safety marking means that the workflow's instance can... [more] | MSS2012-49 pp.23-26 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2012-11-27 13:00 |
Fukuoka | Centennial Hall Kyushu University School of Medicine | Effective Orderings of Instances and Variable Assignments in SAT-based ATPG with Solution Reuse Kenji Ueda, Tsuyoshi Iwagaki, Hideyuki Ichihara, Tomoo Inoue (Hiroshima City Univ.) VLD2012-83 DC2012-49 |
This report discusses the efficiency of iteratively solving various instances with solution reuse in test generation ba... [more] |
VLD2012-83 DC2012-49 pp.141-146 |
| IBISML | 2012-11-08 15:00 |
Tokyo | Bunkyo School Building, Tokyo Campus, Tsukuba Univ. | Multi-Instance SVM using Parametric Programming Naoki Ishihara, Saori Kurumi, Ichiro Takeuchi (NIT) IBISML2012-72 |
In this paper, we propose a new optimization algorithm for multiple instance learning (MIL). MIL is a supervised learnin... [more] | IBISML2012-72 pp.271-276 |
| KBSE | 2007-09-11 14:20 |
Overseas | Kuala Lumpur | The issue of instance generation / extinction in the roll theory Satoshi Endo, Kouji Kozaki, Riichiro Mizoguchi (Osaka Univ.) KBSE2007-26 |
To describe and use knowledge (instances model) based on ontology, it is necessary to consider behavior of instances and... [more] | KBSE2007-26 pp.67-72 |
| PRMU | 2007-03-15 10:00 |
Okayama | An online spam filtering system for changing situations using multiple classifiers Kenta Narumi, Kyosuke Nishida, Koichiro Yamauchi (Hokkaido Univ.) |
Spam mail is a serious problem now. To eliminate many spam mails, many spam mail filters referring mail bodies have been... [more] | PRMU2006-235 pp.1-6 |
|
| MSS, CAS | 2005-11-10 16:15 |
Yamaguchi | Yamaguchi University | A Branch and Bound Algorithm for the Minimum Dominating Set Problem and its Hardware Implementation on FPGAs Kenji Kikuchi, Shin'ichi Wakabayashi (Hiroshima City Univ.) |
A branch and bound algorithm for finding a minimum dominating set of a given graph was proposed,and experimental evaluat... [more] | CAS2005-59 CST2005-28 pp.57-62 |
| CPSY, VLD, IPSJ-SLDM | 2005-01-25 15:20 |
Kanagawa | An Instance-Specific Hardware Algorithm Using FPGAs for the Mimimum Vertex Cover Problem of a Graph Kenji Kikuchi, Shin'ichi Wakabayashi (Hiroshima City Univ.) |
This report presents a hardware algorithm for finding a minimum vertex cover of a given graph, and shows experimental ev... [more] | VLD2004-106 CPSY2004-72 pp.51-56 |
|
[Return to Top Page]