| 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 # | |
| QIT (2nd) |
2022-12-08 14:00 |
Kanagawa | Keio Univ. (Primary: On-site, Secondary: Online) |
[Poster Presentation]
A Note on Quantum Divide and Conquer for Minimal String Rotation Qisheng Wang (NU) |
Lexicographically minimal string rotation is a fundamental problem on string processing that has recently attracted a lo... [more] | |
| SS | 2022-03-07 18:00 |
Online | Online | Extracting Optimal Query Keywords from Bug Report for IR-based Bug Localization Kazuki Hayashi, Takashi Kobayashi (Tokyo Tech.)  SS2021-56 |
Bug Localization is a field that is researched to support locating bugs in software programs. Recent research created op... [more] | SS2021-56 pp.84-89 |
| DE, IPSJ-DBS, IPSJ-IFAT | 2021-09-16 14:45 |
Online | Online | Approximate query processing using synopses embedded b+trees and preliminary experiments Hiroki Yuasa, Kazuo Goda, Masaru Kitsuregawa (UT) DE2021-13 |
In this paper, we propose a new data structure made by incorporating synopses into b+trees, and make use of the incorpor... [more] | DE2021-13 pp.7-12 |
| CPSY, RECONF, VLD, IPSJ-ARC, IPSJ-SLDM [detail] | 2021-01-26 09:00 |
Online | Online | Acceleration of Database Query Processing Using FPGA Hirohiko Ozaku (UEC), Masato Yoshimi (TIS), Celimuge Wu, Tsutomu Yoshinaga (UEC) VLD2020-55 CPSY2020-38 RECONF2020-74 |
A bottleneck of Big data analysis is a time to transfer large amount of data to the main memory from the storage. The da... [more] | VLD2020-55 CPSY2020-38 RECONF2020-74 pp.90-95 |
| IPSJ-SLDM, RECONF, VLD, CPSY, IPSJ-ARC [detail] | 2020-01-23 15:25 |
Kanagawa | Raiosha, Hiyoshi Campus, Keio University | FPGA-based Stream Data Aggregation for Large Sliding-Windows Masaki Osaka (UEC), Masato Yoshimi (TIS), Celimuge Wu, Tsutomu Yoshinaga (UEC) VLD2019-76 CPSY2019-74 RECONF2019-66 |
This paper proposes an FPGA-based Stream Data Aggregation for large Sliding-Windows. We designed Configurable Query Proc... [more] | VLD2019-76 CPSY2019-74 RECONF2019-66 pp.141-146 |
| DE, IPSJ-DBS | 2019-12-24 13:40 |
Tokyo | National Institute of Informatics | A Study on Performance Model of an Analytical Parallel Database System with Dynamic Fault Tolerance Yutaro Bessho, Yuto Hayamizu, Kazuo Goda, Masaru Kitsuregawa (Univ. of Tokyo) DE2019-28 |
Driven by the ever-increasing demand of decision-making applications, database volume continues to grow, leading to prol... [more] | DE2019-28 pp.43-48 |
| CPSY, DC, IPSJ-SLDM, IPSJ-EMB, IPSJ-ARC (Joint) [detail] |
2016-03-25 14:30 |
Nagasaki | Fukue Bunka Hall/Rodou Fukushi Center | Design Evaluation of Low-Latency Handshake Join on FPGA Masato Yoshimi, Yasin Oge, Celimuge Wu, Tsutomu Yoshinaga (UEC) CPSY2015-155 DC2015-109 |
This work revisits the processing of sliding-window joins on FPGAs. In this paper, we propose an FPGA-based implementati... [more] | CPSY2015-155 DC2015-109 pp.253-258 |
| IA | 2016-01-29 15:15 |
Tokyo | Kikai-Shinko-Kaikan Bldg. B3 Kenshu-2 room | An effective and cost efficient load balancing method for range queriable cloud storage Xun Shao, Masahiro Jibiki, Yuuichi Teranishi, Nozomu Nishinaga (NICT) IA2015-85 |
The rising popularity of big data processing for semantically rich applications such as social networks and IoT (Interne... [more] | IA2015-85 pp.37-42 |
| VLD, CPSY, RECONF, IPSJ-SLDM, IPSJ-ARC [detail] | 2016-01-19 17:45 |
Kanagawa | Hiyoshi Campus, Keio University | FPGA-based Parallel Processing of Sliding-Window Aggregate Queries on Data Streams Yoshimitsu Ogawa, Yasin Oge, Masato Yoshimi, Celimuge Wu, Tsutomu Yoshinaga (UEC) VLD2015-86 CPSY2015-118 RECONF2015-68 |
In this report, we present an evaluation of Configurable Query Processing Hardware (CQPH) implemented on multiple FPGAs.... [more] | VLD2015-86 CPSY2015-118 RECONF2015-68 pp.79-84 |
| AI | 2015-12-04 15:35 |
Fukuoka | Kyutech-Salite | A Streaming Algorithm on a Big Data Replay Engine is Best Written as a jQuery Script Marat Zhanikeev (Kyutech) AI2015-22 |
The idea of using jQuery general logic and its concept of chains as a natural language processing environment has been p... [more] | AI2015-22 pp.57-60 |
| AI, SC | 2014-08-20 15:40 |
Tokyo | National Institute of Informatics | A Preliminary Analysis on Dynamic Query Optimisation Mechanism for SPARQL Query Processing Yuji Yamagata, Naoki Fukuta (Shizuoka Univ.) AI2014-15 SC2014-12 |
- [more] | AI2014-15 SC2014-12 pp.25-30 |
| RECONF | 2013-09-18 15:30 |
Ishikawa | Japan Advanced Institute of Science and Technology | An Implementation of High Performance Stream Processing on a Reconfigurable Hardware Eric Shun Fukuda (Hokkaido Univ.), Hideyuki Kawashima (Univ. of Tsukuba), Hiroaki Inoue (NEC), Taro Fujii, Koichiro Furuta (Renesas Electronics), Tetsuya Asai, Masato Motomura (Hokkaido Univ.) RECONF2013-21 |
Stream processing is one of the applications that reconfigurable hardware can be highly effective. In this paper, we giv... [more] | RECONF2013-21 pp.7-12 |
| DE, IPSJ-DBS, IPSJ-IFAT | 2013-07-23 14:00 |
Hokkaido | Hokkaido University | Query Processing in Moving Robot Databases Kento Sugiura, Arata Hayashi, Yoshiharu Ishikawa (Nagoya Univ.) DE2013-26 |
In this paper, we propose methods for monitoring query processing in moving robot databases. We develop our approach bas... [more] | DE2013-26 pp.145-150 |
| COMP | 2013-06-24 10:35 |
Nara | Nara Women's University | Shortest Path Queries by Labeling for Paths with Pruning in Road Networks Yuki Kawata, Takuya Akiba, Yoichi Iwata (Univ. of Tokyo) COMP2013-20 |
Shortest-Path problem is a fundamental problem in road networks and a lot of methods are proposed. In the labeling appro... [more] | COMP2013-20 pp.7-15 |
| COMP | 2013-04-24 10:00 |
Hyogo | Kobe University | Answering Reachability Queries by Extending Pruned BFSs to Paths Yosuke Yano, Takuya Akiba, Yoichi Iwata (Univ. of Tokyo) COMP2013-1 |
The graph reachability is a fundamental problem, both theoretically and practically. However, it is still a challenging ... [more] | COMP2013-1 pp.1-8 |
| PRMU | 2013-02-22 14:30 |
Osaka | Sequence Number-free Detection of Similar Sequences Among Multiple Sequences
-- Proposal of Circle Continuous Dynamic Programming -- Ryuichi Oka (Aizu Univ.) PRMU2012-172 |
We propose a method called Circle Continuous Dynamic Programming (CCDP) for sequence number-free detection of similar se... [more] | PRMU2012-172 pp.197-202 |
|
| NLC | 2012-12-20 10:00 |
Tokyo | Ookayama Campasu, Tokyo Institute of Technology | New Dataflow UML for Description and Modeling of Survey Data Processing Marat Zhanikeev (Tokyo Univ. of Science) NLC2012-40 |
The problem is simple. When you make or have someone make a database for you, you can use UML to describe the structure... [more] | NLC2012-40 pp.41-46 |
| DE | 2012-12-13 15:50 |
Kyoto | Campus Plaza Kyoto | Consideration on Ad hoc query processing with Adaptive Index in Map Reduce Environment Shohei Okudera, Daisaku Yokoyama, Miyuki Nakano, Masaru Kitsuregawa (Univ. Tokyo) DE2012-37 |
MapReduce-based processing infrastructure is getting more important as a data analysis system,which executes ad-hoc quer... [more] | DE2012-37 pp.131-136 |
| DE | 2012-08-01 11:30 |
Aichi | Nagoya University | Exploration on Efficient Similar Sentences Extraction Yanhui Gu, Zhenglu Yang, Miyuki Nakano, Masaru Kitsuregawa (Univ. of Tokyo) DE2012-19 |
Similar sentences extraction is an essential issue for many applications, such as natural language processing, Web page ... [more] | DE2012-19 pp.17-22 |
| NS, IN (Joint) |
2012-03-09 13:50 |
Miyazaki | Miyazaki Seagia | Arrangement of Virtual Nodes on Consistent Hashing for Various Retrieval and Load balancing Satoshi Kondoh, Masashi Kaneko, Takeshi Fukumoto, Kiyoshi Ueda (NTT) NS2011-270 |
Recently, distributed DBs that is spreading in various fields use Multi-staged Tablet algorithm or Consistent Hashing al... [more] | NS2011-270 pp.517-522 |
[Return to Top Page]