| 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 # | |
| ICSS | 2009-11-13 11:05 |
Miyazaki | University of Miyazaki | Similarity Scoring Method of Runtime Packed Malware and its Evaluation Tatsunori Orii, Katsunari Yoshioka, Junji Shikata, Tsutomu Matsumoto (Yokohama Nat Univ.), Hyung Chan Kim, Daisuke Inoue, Koji Nakao (NICT)  ICSS2009-55 |
A great number of malware have been generated and released over the Internet because of the underground distribution of ... [more] | ICSS2009-55 pp.7-12 |
| COMP | 2009-09-14 15:40 |
Tottori | Tottori University of Environmental Studies | A Rooted-forest Partition with Uniform Vertex Demand and Its Application to the Rigidity Theory Naoki Katoh, Shin-ichi Tanigawa (Kyoto Univ.) COMP2009-31 |
A rooted-forest is a graph having self-loops such that each connected component contains exactly one loop, which is rega... [more] | COMP2009-31 pp.43-50 |
| RCS, IN (Joint) |
2009-05-22 09:20 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | An Optimum Modulation in n-Dimensional Euclidean Space Takeharu Kohri (Sizuoka Inst. of Sci and Tech.) RCS2009-14 |
The modulation method of sending maximum information by a minimum electric power explains obtaining by Hypersphere Packi... [more] | RCS2009-14 pp.79-83 |
| MSS, CAS | 2007-11-30 14:30 |
Niigata | Niigata University | Code System for Rectangular Packing in 2D Torus Space Takayuki Shibata, Mineo Kaneko (JAIST) CAS2007-80 CST2007-31 |
We encounter rectangular packing in 2D Torus space in VLSI layout where the same set of components is placed repeatedly ... [more] | CAS2007-80 CST2007-31 pp.37-42 |
| VLD, CPSY, RECONF, DC, IPSJ-SLDM, IPSJ-ARC (Joint) [detail] |
2007-11-22 13:25 |
Fukuoka | Kitakyushu International Conference Center | Improved Method of Rectilinear Block Packing Based on O-Tree Representation Hidehiko Ukibe, Kunihiro Fujiyoshi (TUAT) VLD2007-96 DC2007-51 |
In this paper, we propose an improved method to represent rectilinear block packing based on an expanded O-Tree. Here... [more] |
VLD2007-96 DC2007-51 pp.43-48 |
| COMP | 2005-04-18 10:35 |
Hyogo | Kwansei Gakuin Univ. | Exact Algorithms for the Two-Dimensional Strip Packing Problem with Rotations Mitsutoshi Kenmochi, Takashi Imamichi, Koji Nonobe, Mutsunori Yagiura, Hiroshi Nagamochi (Kyoto Univ.) |
We examine various strategies for exact approaches to the 2-dimensional strip packing problem (2SP) with and without rot... [more] | COMP2005-2 pp.5-14 |
| NLP | 2004-05-18 15:20 |
Miyagi | Tohoku Univ. | * Hirokazu Yamagishi (Shizuoka Univ.), Hiroshi Ninomiya (SIT), Hideki Asai (Shizuoka Univ.) |
The three dimensional (3D) packing is to arrange given rectangular boxes in a rectangular box of the minimum volume wi... [more] |
NLP2004-10 pp.53-58 |
[Return to Top Page]