| 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 # | |
| PRMU | 2009-03-14 13:15 |
Miyagi | Tohoku Institute of Technology | Approximate nearest neighbor search algorithm on HDD based on B+ tree. Noritaka Himei, Toshikazu Wada (Wakayama Univ.)  PRMU2008-273 |
Nearest Neighbor (NN) search plays important roles in example-based Computer Vision algorithms. Accelerating NN search i... [more] | PRMU2008-273 pp.223-228 |
| SP | 2009-01-29 14:20 |
Nara | NAIST | Ultra-Rapid Speech Recognition based on Search Termination using Confidence Scoring Hiroshi Kojima, Yoshihiko Nankaku, Akinobu Lee, Keiichi Tokuda (Nagoya Inst. of Tech.) SP2008-128 |
In spite of the recent advances of speech recognition technology, a speech interface does not become a friendly, easy-to... [more] | SP2008-128 pp.13-18 |
| PRMU, DE | 2008-06-19 14:00 |
Hokkaido | Otaru-Shimin-Kaikan | A study on fast search of the nearest string in edit distance Hiroyuki Hanada, Mineichi Kudo (Hokkaido Univ.) DE2008-8 PRMU2008-26 |
The problem is finding the nearest string, measured by edit distance, to a query string $q$ from a set $T$ of strings. ... [more] |
DE2008-8 PRMU2008-26 pp.41-46 |
| NS, IN (Joint) |
2007-03-08 11:30 |
Okinawa | Okinawa Convention Center | Automatic parameter setting to satisfy requirement of users on the search method under success rate management Masaki Yada (Tokyo Inst. of Tech.), Shinji Sugawara (Nagoya Inst. of Tech.), Kiyohito Yoshihara (KDDI Lab.), Katsunori Yamaoka (Tokyo Inst. of Tech.) IN2006-215 |
A search method under success rate management is proposed on network environment that nodes have lack of memory. It has ... [more] | IN2006-215 pp.207-212 |
| ET | 2007-01-26 19:30 |
Tokyo | A Motion Mining Method for Supporting Skill Improvement Training for Martial Arts Kazumoto Tanaka, Makoto Hasegawa, Yoshinobu Kurose, Kikuo Kobayashi (Kinki Univ.) |
Skills of BUDO (Martial Arts) are tacit knowledge, therefore it is difficult to indicate key points of the skills explic... [more] | ET2006-105 pp.127-132 |
|
| NLP | 2006-03-20 15:20 |
Tokyo | Hosei Univ.(Ichigaya Campus) | Two-Staged Tabu Search for Floorplan Problem Using O-Tree Structure Kimihiko Numayama (Shizuoka Univ), Hiroshi Ninomiya (SIT), Hideki Asai (Shizuoka Univ) |
This papar describes the two-staged Tabu search for the non-slicing floorplan problem using the orderd tree representat... [more] | NLP2005-146 pp.53-58 |
| PRMU | 2006-03-16 10:45 |
Fukuoka | Kyushu Univ. | * Hidetaka Arai, Takekazu Kato, Toshikazu Wada (Wakayama Univ.) |
Nearest Neighbor (NN) search is essential for case/instance based reasoning. Most NN search methods proposed so far are ... [more] | PRMU2005-239 pp.41-48 |
| PRMU, NLC | 2005-02-25 14:45 |
Tokyo | [Special Talk]
Nearest Neighbor Search and Classification for Image Understanding Toshikazu Wada, Koji Takemoto (Wakayama Univ.) |
Nearest neighbor search is one of the most fundamental technique, which is applied to wide varieties of problems, such a... [more] | NLC2004-128 PRMU2004-210 pp.73-78 |
|
| MSS | 2005-01-27 15:40 |
Tokyo | Univ. of Electro-Communications | A I Clusteringethod based on Multiple Quasi-Minimum Spanning Trees Daisuke Kagawa, Morikazu Nakamura (Ryukyu Univ.), Yumiko Nakajima (Univ. of the Ryukyus) |
This paper proposes a clustering method based on multiple quasi-minimal spanning trees to obtain good quality clusters f... [more] | CST2004-49 pp.61-65 |
[Return to Top Page]