| 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 # | |
| AI | 2007-05-31 14:00 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | [Invited Talk]
Recent Topics on Data Mining and Knoledge Discovery Using Binary Decision Diagrams Shin-ichi Minato (Hokkaido Univ.)  AI2007-6 |
Binary Decision Diagrams (BDDs) are the efficient data structure for representing Boolean functions on the main memory. ... [more] | AI2007-6 pp.27-32 |
| COMP | 2007-05-25 15:55 |
Fukuoka | Kyushu University | Optimality and Algorithms for the Balanced Edge Cover Problem Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita (Kyushu Univ.) COMP2007-17 |
For an undirected graph $G = (V, E)$, an edge cover is defined as a set of edges that covers all vertices of $V$. It is... [more] | COMP2007-17 pp.37-42 |
| COMP | 2006-10-17 14:50 |
Miyagi | Tohoku University | A Randomness Based Analysis on the Data Size Needed for Generating Reliable Rules Kazuya Haraguchi (Kyoto Univ.), Mutsunori Yagiura (Nagoya Univ.), Endre Boros (Rutgers Univ.), Toshihide Ibaraki (Kwansei Gakuin Univ.) |
We consider a two-labeled data set $X=X_1\cup X_0$ in which each xample is a Boolean vector. A pattern is a co-occurrenc... [more] | COMP2006-38 pp.57-64 |
| DE | 2006-07-13 11:25 |
Niigata | HOTEL SENKEI | Visual Description Extraction Using Search Engines' Metadata for Reinforcing Route Guidance Shun Hattori, Taro Tezuka, Katsumi Tanaka (Kyoto Univ.) |
Moving from a place to another in the real world is one of daily activities for us. Various route guidance systems to su... [more] | DE2006-72 pp.131-136 |
| CAS, SIP, CS | 2006-03-07 11:45 |
Okinawa | Univ of Ryukyu | Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three Kenya Sugihara, Hiro Ito (Kyoto Univ.) |
Given a graph $G=(V,E)$, a set of vertices $S\subseteq V$ covers a vertex $v\in V$ if the edge-connectivity between $S$ ... [more] | CAS2005-122 SIP2005-168 CS2005-115 pp.25-29 |
| ITS | 2005-11-18 16:15 |
Tottori | Hotel Monarque Tottori (Tottori City) | Accident Analysis based on Knowledge Discovery from Massive Accident Database
-- Hypothesis Creation by Multi-dimensional Search over Ambiguous Data Space -- Kenji Fujihira, Yasuhiro Fukuju (Univ. of Tokyo), Hiroshi Warita (MEX), Atsushi Tanaka (ORICONSUL), Shunsuke Kamijo (Univ. of Tokyo) |
Towards the reduction of traffic accidents, many researchers have concentrated on accident analysis. The common approach... [more] | ITS2005-38 pp.35-40 |
| ICD | 2005-05-27 10:00 |
Hyogo | Kobe Univ. | A 10-Gb/s Burst-Mode CDR IC in 0.13-um CMOS Masafumi Nogawa, Kazuyoshi Nishimura, Shunji Kimura, Tomoaki Yoshida, Tomoaki Kawamura, Minoru Togashi, Kiyomi Kumozaki, Yusuke Ohtomo (NTT) |
A 10-Gb/s burst-mode CDR IC was fabricated in a 0.13-$\mu$m CMOS process for the high-speed packet-based networks of the... [more] | ICD2005-28 pp.1-5 |
| PRMU, TL | 2005-03-18 09:45 |
Akita | An Interactive Knowledge Processing System Hanfeizi to Make Coexistence of Rules with Inconsistencies
-- An Implementation by Prolog and Some Examples of Behavior -- Yousuke Sasaki, Hiroyuki Kameda (Tokyo Univ. of Technology) |
The previous knowledge processing systems have been mainly designed to process knowledge without inconsistencies. Howeve... [more] | TL2004-68 PRMU2004-236 pp.29-34 |
|
[Return to Top Page]