| 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 # | |
| LOIS | 2014-03-07 11:40 |
Okinawa | Source code navigation using code patterns Ken Nakayama (Tsuda College), Eko Sakai (Otani Univ.)  LOIS2013-58 |
There are semantic chunks and relations (code patterns) of various granularities in source code. Since a code pattern i... [more] | LOIS2013-58 pp.23-28 |
|
| MSS, SS | 2013-03-07 13:00 |
Fukuoka | Shikanoshima | [Invited Talk]
Online Adaptation of Decision Making on a Soccer Agent Team Hidehisa Akiyama (Fukuoka Univ.) MSS2012-79 SS2012-79 |
In the RoboCup soccer simulation, our purpose is to improve the team performance by encouraging a cooperation or compet... [more] |
MSS2012-79 SS2012-79 pp.115-120 |
| PRMU, HIP | 2012-12-13 14:00 |
Yamagata | High-Accuracy Clustering Using LDA for Fast Japanese Character Recognition Takahiro Sasaki, Hideaki Goto (Tohoku Univ.) PRMU2012-73 HIP2012-62 |
Recognizing text in natural scene images is very important to develop various systems such as an assis- tant device for... [more] |
PRMU2012-73 HIP2012-62 pp.19-24 |
|
| ITE-ME, ITE-AIT, IE [detail] | 2011-11-11 11:40 |
Fukuoka | Smart Dictionary for Learning-Based Super-Resolution Akinobu Hashimoto, Tomohiro Nakaya, Nobutaka Kuroki, Tetsuya Hirose, Masahiro Numa (Kobe Univ.) IE2011-83 |
In this paper, a novel dictionary construction technique for example based super-resolution is proposed. Conventional te... [more] | IE2011-83 pp.35-40 |
|
| IBISML | 2011-06-20 17:15 |
Tokyo | Takeda Hall | Fast Similarity Search of Binary Codes with Wavelet Tree Yasuo Tabei (JST), Koji Tsuda (CBRC) IBISML2011-15 |
Similarity search using locality sensitive codes is recently of increasing interest due to unprecedented scalability. Un... [more] | IBISML2011-15 pp.103-110 |
| ET | 2011-06-17 14:15 |
Aichi | Paper Classification for Supporting Creative Research Masato Aoki, Yuki Hayashi (Nagoya Univ.), Tomoko Kojiri (Kansai Univ.), Toyohide Watanabe (Nagoya Univ.) ET2011-20 |
The researchers at an early stage need to determine the research subject. In many cases, they read research papers for i... [more] | ET2011-20 pp.15-20 |
|
| COMP | 2011-03-09 13:00 |
Tokyo | Chuo Univ. | New k shortest simple path algorithm that reduces the average case time complexity Hiroshi Matsuura (NTT) COMP2010-49 |
The author proposed k-SPF-plus algorithm that realizes to shorten the worst case time complexity for creating k shortest... [more] | COMP2010-49 pp.17-24 |
| IN, NS (Joint) |
2011-03-03 10:30 |
Okinawa | Okinawa Convention Center | Decision Tree Based Flow Search Hardware Engine Combined with Linear Search Eita Kobayashi, Norio Yamagaki, Takashi Takenaka, Satoshi Kamiya, Masato Motomura (NEC) NS2010-203 |
Recently, multi-field packet classification is increasingly becoming more important to enable fine-grained flow control ... [more] | NS2010-203 pp.229-234 |
| IN, NS (Joint) |
2011-03-04 09:10 |
Okinawa | Okinawa Convention Center | An in-network spam filtering method using nearest neighbor search of edit distance Yosuke Tsukajima, Akihiro Nakao (Univ. of Tokyo) NS2010-244 |
Email has become an indispensable means for the communication in social life. However, a huge amount of spam has become ... [more] | NS2010-244 pp.449-454 |
| NLC, SP (Joint) [detail] |
2010-12-21 11:05 |
Tokyo | National Olympics Memorial Youth Center | Evaluation of Successive Rapid Hypothesis Determination Algorithm for Continuous Word Recognition Hiroyuki Ohno (Nagoya Inst. of Tech.), Hiroshi Kojima (Nagoya Inst. of Tech/Hitachi Solutions, Ltd.), Yoshihiko Nankaku, Akinobu Lee, Keiichi Tokuda (Nagoya Inst. of Tech.) NLC2010-21 SP2010-94 |
Minimizing response delay of speech recognition system and giving rapid feed backs are important properties for an intui... [more] | NLC2010-21 SP2010-94 pp.77-82 |
| IN | 2010-12-17 10:25 |
Hiroshima | Hiroshima City Univ. | A proposal of k shortest simple path algorithm to minimize computational complexity Hiroshi Matsuura (NTT) IN2010-107 |
k shortest path algorithm is expected to be applied to creating replacement paths and traffic dispersion by using multip... [more] | IN2010-107 pp.57-62 |
| PRMU, FM | 2010-12-10 11:10 |
Yamaguchi | Target identification for multi images using a search tree Takumi Honma, Nobuyuki Takahashi (FUN) PRMU2010-142 |
We develop a target identi cation that is robust in a variety of changed situation and noises uses search tree and show ... [more] | PRMU2010-142 pp.91-96 |
|
| AI | 2010-06-25 14:15 |
Tokyo | Refining Noisy Training Examples Based on Ensemble Learning for Intelligent Domain-Specific WEB Search Hiroki Hirabayashi, Koji Iwanuma, Yoshitaka Yamamoto, Hidetomo Nabeshima (Univ. of Yamanashi) AI2010-5 |
The Keyword Spices, proposed Oyama et al., is a sort of a query-expansion technology, which adds pre-computed additional... [more] | AI2010-5 pp.25-30 |
|
| IBISML | 2010-06-14 10:25 |
Tokyo | Takeda Hall, Univ. Tokyo | [Invited Talk]
All Pairs Similarity Search by Multiple Sorting Koji Tsuda (AIST) IBISML2010-2 |
Recently it is increasingly common that images and signals are mapped to bit strings called sketches. To build a simila... [more] |
IBISML2010-2 p.3 |
| IE | 2010-03-15 11:20 |
Miyagi | RIEC Bldg. #2, 4gh Floor, Tohoku Univ. | Target identification for multi images using a search tree Takumi Honma, Nobuyuki Takahashi (FUN) IE2009-182 |
We develop a target identification that is robust in a variety of changed situation and noises uses search tree and show... [more] | IE2009-182 pp.19-24 |
| COMP | 2010-03-12 15:50 |
Tokyo | National Institute of Informatics | Online graph exploration algorithms for cycles and trees by multiple number of searchers Yuya Higashikawa, Naoki Katoh, Shin-ichi Tanigawa (Kyoto Univ.), Stefan Langerman (ULB) COMP2009-57 |
This paper deals with online graph exploration problems by multiple searchers. The purpose of search is to visit all ver... [more] | COMP2009-57 pp.49-56 |
| NS, IN (Joint) |
2010-03-04 09:20 |
Miyazaki | Miyazaki Phoenix Seagaia Resort (Miyazaki) | Random Walk Search for Unstructured Peer-to-Peer Overlays Using Hop-Limited Shortest Path Trees Phouvieng Hieungmany, Shigeo Shioda (Chiba Univ.) IN2009-164 |
We propose an efficient random-walk-based file search on unstructured P2P networks. In the proposal, each node keeps tw... [more] | IN2009-164 pp.121-126 |
| IA, SITE, IPSJ-IOT [detail] | 2010-03-02 10:40 |
Miyagi | Evaluation of Multi-dimensional Range Search Algorithm in P2P Networks Using B+-Tree Nobuhiko Matsuura, Hiroshi Mineno (Shizuoka Univ.), Norihiro Ishikawa (NTT DoCoMo, Inc.), Tadanori Mizuno (Shizuoka Univ.) SITE2009-63 IA2009-115 |
Along with the development of the wireless technology and sensor technology, the context-aware service which uses sensin... [more] | SITE2009-63 IA2009-115 pp.235-240 |
|
| PRMU | 2010-02-19 15:30 |
Tokyo | Tokyo Univ. of Agriculture and Technology | Development of a Path Search Method in Candiate Character Network Using Recursicve Transition Network. Toshikazu Takahashi, Takeshi Nagasaki, Masashi Koga (Hitachi) PRMU2009-231 |
We have developed a novel linguistical matching method (called "3.5 generation RTN matching") operated on context free g... [more] | PRMU2009-231 pp.141-146 |
| CPSY, DC (Joint) |
2009-08-04 - 2009-08-05 |
Miyagi | Acceleration of Monte-Carlo Go by FPGA-based Hardware Kenichi Koizumi (Univ. of Tokyo), Yasuo Ishii (NEC Corp.), Kazuki Yoshizoe (JST), Takefumi Miyoshi (Tokyo Inst. of Tech.), Yutaka Sugawara (IBM), Mary Inaba, Kei Hiraki (Univ. of Tokyo) CPSY2009-19 |
In the monte-carlo simulation of Go, it takes time to run playouts. There were attempts of accelerating by implementing... [more] |
CPSY2009-19 pp.55-60 |
|
[Return to Top Page]