| 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 # | |
| CAS, MSS, IPSJ-AL [detail] | 2019-11-29 09:45 |
Fukuoka | Exact Algorithm for Sorting Rules in Firewall Ryosuke Fumiiwa, Toshinori Yamada (Saitama Univ.)  CAS2019-55 MSS2019-34 |
Given a firewall policy(a sequence of packet rules), the sorting problem of rules in a firewall is to sort the rules in ... [more] | CAS2019-55 MSS2019-34 pp.73-78 |
|
| COMP | 2016-10-21 13:30 |
Miyagi | Tohoku University | Physical Bucket Sort with Two Kinds of Items Atsuki Nagao, Shuhei Yoshizawa, Hiro Ito (UEC) COMP2016-26 |
Bucket sort is one of the most famous sorting algorithms, and it runs in time $O(k+n)$, where $k$ is the number of bucke... [more] | COMP2016-26 pp.23-27 |
| COMP | 2016-04-22 14:30 |
Nara | Physical Bucket Sort John Iacono (NY Univ.), Hiro Ito, Atsuki Nagao, Junji Nishino (UEC), David Rappaport (Queen's Univ.) COMP2016-5 |
Bucket sort is one of the most famous sorting algorithm, which runs in O(k + n)-time where k is the number of buckets an... [more] | COMP2016-5 pp.29-34 |
|
| ICD, MW | 2016-03-02 14:05 |
Hiroshima | Hiroshima University | An Implementation of Hardware Sorting Algorithms using the FPGA Naoyuki Matsumoto, Xin Zhou, Koji Nakano, Yasuaki Ito (Hiroshima Univ.) MW2015-180 ICD2015-103 |
The main contribution of this paper is to design $K$-sorter which sorts $K$ keys given from the input port one by one in... [more] | MW2015-180 ICD2015-103 pp.37-42 |
| CS, CQ (Joint) |
2014-04-25 14:15 |
Hiroshima | Hiroshima City University | Traffic Engineering Technique for Minimizing Node Interfaces Kouichi Genda, Hiroki Mori, Shohei Kamamura, Yoshihiko Uematsu, Koji Sasayama (NTT) CS2014-14 |
To achieve an economical carrier network using center-controlled SDN technology, this paper presents path establishment ... [more] | CS2014-14 pp.67-71 |
| COMP | 2013-12-21 11:25 |
Okinawa | Okinawa Industry Support Center | Efficient Algorithms for Sorting $k$-Sets in Bins Kazuhisa Seto (Seikei Univ.), Junichi Teruyama (NII), Atsuki Nagao (Kyoto Univ.) COMP2013-52 |
We give efficient algorithms for Sorting $k$-Sets in Bins. The Sorting $k$-Sets in Bins problem can be described as f... [more] |
COMP2013-52 pp.81-85 |
| COMP, IPSJ-AL | 2013-05-17 16:05 |
Hokkaido | Otaru University of Commerce | On Complexities of Parallel Sort Algorithms on AGPU model Atsushi Koike, Kunihiko Sadakane, Hoa Vu (NII) COMP2013-13 |
This paper is concerned with complexities of parallel sorting algorithms on AGPU model. First, we analyze known sort al... [more] |
COMP2013-13 pp.75-80 |
| COMP | 2004-10-15 14:45 |
Miyagi | Tohoku University | Mizue Ushijima, Akihiro Fujiwara (Kyushu Inst. Tech.) |
In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has considerable... [more] | COMP2004-47 pp.25-32 |
[Return to Top Page]