| 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 # | |
| COMP, IPSJ-AL | 2024-05-08 14:35 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Physical Bucket Sort on Two Kind of Items Hitomi Kozaki, Atsuki Nagao (Ochanomizu Univ.)  COMP2024-2 |
When physically emulating the bucket sort, it would be care that some costs are incurred when placing items into buckets... [more] | COMP2024-2 pp.2-6 |
| IMQ | 2023-12-22 15:30 |
Toyama | University of Toyama | Construction and validation of a bus passenger counting system using DeepSORT Soichiro Yanagihara, Yuukou Horita (Univ. of Toyama) IMQ2023-12 |
Recently, transportation IC cards have been introduced mainly in urban areas, not only for the cashless system, but also... [more] | IMQ2023-12 pp.16-21 |
| KBSE, IPSJ-SE, SS [detail] | 2021-07-08 15:40 |
Online | Online (Zoom) | A Study of the Fruit Sorting System Using YOLO Object Detection Hiroyuki Akai, Mengchun Xie, Mitsutoshi Murata, Nobuo Iwasaki, Toru Mori (NIT, Wakayama College) SS2021-8 KBSE2021-20 |
Recently, the development of systems for agriculture using deep learning has been progressing. When applying deep learni... [more] | SS2021-8 KBSE2021-20 pp.41-45 |
| 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 |
|
| ET | 2018-05-19 10:20 |
Kanagawa | National Institute of Special Needs Education | A Support System for Applied Java Programming Exercises toward Stepwise Development and Test Driven Approach
-- A Virtual Experiment and User Evaluation with Revision and Extension of a Sorting Program Code -- Reo Ishii, Kento Tsuji, Hiroyuki Tominaga (Kagawa Univ.) ET2018-3 |
In introductory Java exercises, we learn basic object-oriented concepts and implement the functions of each object.In th... [more] | ET2018-3 pp.11-16 |
| WBS, IT, ISEC | 2018-03-09 14:20 |
Tokyo | Katsusika Campas, Tokyo University of Science | Improved Lossless Compression by Substring Enumeration Using Sorting Takahiro Ota (NPIT), Akiko Manada (UEC) IT2017-135 ISEC2017-123 WBS2017-116 |
This paper proposes an improved compression by substring enumeration (CSE) with a finite alphabet. For an input string, ... [more] | IT2017-135 ISEC2017-123 WBS2017-116 pp.191-196 |
| 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 |
| SR, SRW (Joint) |
2016-05-17 14:00 |
Overseas | Hotel Lasaretti, Oulu, Finland | [Poster Presentation]
QR-Decomposed Subgraph Belief Propagation for Large MIMO Systems Shogo Tanabe, Koji Ishibashi (Univ. Electro-Comm.) SR2016-20 SRW2016-17 |
In this paper, we discuss a novel low-complexity detection based on belief propagation (BP) algorithm for large-scale mu... [more] | SR2016-20 SRW2016-17 pp.71-72(SR), pp.59-60(SRW) |
| 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 |
| VLD, DC, IPSJ-SLDM, CPSY, RECONF, ICD, CPM (Joint) [detail] |
2014-11-26 14:45 |
Oita | B-ConPlaza | Development and Evaluation of Pipelining of Heap-Sort Execution for Low-Latency Stream Data Processing Yoshifumi Fujikawa, Tetsuro Hommura, Tadayuki Matsumura (Hitachi) CPSY2014-72 |
The feature of low latency is becoming important for applications of Stream Data Processing (SDP) such as HFT, and so is... [more] | CPSY2014-72 pp.1-6 |
| 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 |
| IT | 2010-09-22 11:20 |
Miyagi | Tohoku Gakuin University | A Sorting-Based Architecture of Finding the First Two Minimum Values Qian Xie, Zhixiang Chen, Satoshi Goto (Waseda Univ.) IT2010-43 |
In this paper we propose a sorting-based architecture of finding the first two minimum values. Given a set of numbers X,... [more] | IT2010-43 pp.57-61 |
| COMP | 2010-06-25 16:35 |
Tokyo | Tokyo Tech | On the Existence and Reconstruction of a Simple Graph with a Given Joint-Degree Sequence Shigeo Shioda (Chiba Univ.) COMP2010-23 |
We refer to a pair of degrees of two end nodes of a link as a {\it joint degree}, and refer to a list of joint degrees o... [more] | COMP2010-23 pp.53-60 |
| COMP | 2010-01-25 15:00 |
Fukuoka | Nishijin Plaza, Kyushu University | An Almost Optimal Algorithm for Winkler's Sorting Pairs in Bins Hiro Ito, Junichi Teruyama, Yuichi Yoshida (Kyoto Univ.) COMP2009-45 |
We investigate the following sorting puzzle: We are given $n$ bins with two balls in each bin. Balls in the $i$th bin ... [more] |
COMP2009-45 pp.45-49 |
| ISEC | 2009-09-25 10:45 |
Tokyo | Kikai-Shinko-Kaikan Bldg. | A Study on Higher Order Difference Operation for Calculating a Large Number of Elliptic Curve Scalar Multiples Tomoko K. Matsushima, Yoshitaka Sagara, Nobuhide Sakuragi (Polytechnic Univ.), Osamu Ashihara ISEC2009-40 |
Efficient elliptic curve arithmetic is crucial for cryptosystems based on elliptic curves. Such cryptosystems often requ... [more] | ISEC2009-40 pp.1-8 |
| COMP | 2009-09-14 14:30 |
Tottori | Tottori University of Environmental Studies | On the possible patterns of inputs for block sorting Takashi Saso, Kojiro Kobayashi (Soka Univ.) COMP2009-29 |
Burrows--Wheeler transformation is a useful transformation that is used as a preprocessing for data compression, and blo... [more] | COMP2009-29 pp.27-33 |
| IN, PN (Joint) |
2006-10-12 11:20 |
Tokyo | Network Sort Engine Based on Concurrent Heap
-- Toward Implementing Massive and Ultra High Speed Per-flow Queuing -- Muneyoshi Suzuki, Katsuya Minami (NTT) IN2006-77 |
Network Sort Engine (NSE) that rapidly identifies the highest priority from numerous priorities is indispensable to enab... [more] | IN2006-77 pp.1-6 |
|
[Return to Top Page]