Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
SIP, BioX, IE, MI, ITE-IST, ITE-ME [detail] |
2022-05-20 14:00 |
Kumamoto |
Kumamoto University Kurokami Campus (Primary: On-site, Secondary: Online) |
Hadamard-Coded Supervised Discrete Hashing on Quaternion Domain Manabu Sueyasu (The Univ. Kitakyushu), Seisuke Kyochi (Kogakuin Univ.), Gou Koutaki (Kumamoto Univ.) SIP2022-23 BioX2022-23 IE2022-23 MI2022-23 |
This paper extends Hadamard-coded supervised discrete hashing on real domain (termed as $mathbb{R}$-HCSDH) using a real-... [more] |
SIP2022-23 BioX2022-23 IE2022-23 MI2022-23 pp.117-122 |
PRMU |
2020-09-02 16:15 |
Online |
Online |
Pseudo Perfect Coding for Discrete Cross-modal Hashing Yusuke Masuda, Gou Koutaki (Kumamoto Univ.) PRMU2020-16 |
Recently, cross-modal hashing has attracted attention in the field of image processing.
Compressing data which have di... [more] |
PRMU2020-16 pp.53-57 |
SIP, EA, SP, MI (Joint) [detail] |
2018-03-20 10:40 |
Okinawa |
|
[Invited Talk]
Progress of Research on Cross-modal Scene Analysis Kunio Kashino (NTT) EA2017-166 SIP2017-175 SP2017-149 |
The problem of scene analysis means to understand, or describe, various external objects or events associated with spati... [more] |
EA2017-166 SIP2017-175 SP2017-149 p.353 |
ICD, CPSY |
2014-12-01 15:15 |
Tokyo |
Kikai-Shinko-Kaikan Bldg. |
[Poster Presentation]
A Scalable Hardware Architecture of Locality-Sesitive Hashing for similarity Search Tsunaki Sadahisa, Kasho Yamamoto, Dahoo Kim, Eric S. Fukuda, Tetsuya Asai, Masato Motomura (Hokkaido Univ.) ICD2014-83 CPSY2014-95 |
Locality-Sensitive Hashing (LSH) is a hash function that projects similar data into memory closely. In similarity search... [more] |
ICD2014-83 CPSY2014-95 p.45 |
NS |
2014-04-17 12:55 |
Okinawa |
Ishigaki-City-Hall |
Access Methods for Distributed Key-Value Stores with Highly SkewedAccess Distribution of Keys Hiroyuki Kurita, Naoki Takada, Takao Yamashita, Tomoharu Motono (NTT) NS2014-6 |
Distributed Key-Value Stores are becoming applicable to various applications, such as not only Web applications but auth... [more] |
NS2014-6 pp.27-32 |
NS |
2014-04-17 13:20 |
Okinawa |
Ishigaki-City-Hall |
Comparison of Load Balancing Designed for Requests Following Zipfian Distribution and Hybrid Load Balancer Using Round-Robin and Consistent Hashing Takao Yamashita, Hiroyuki Kurita, Naoki Takada, Kenji Ota (NTT) NS2014-7 |
In this paper, we evaluate, by simulation, how much amount of memory a load balancing method we previously proposed to p... [more] |
NS2014-7 pp.33-38 |
NS, IN (Joint) |
2013-03-08 09:00 |
Okinawa |
Okinawa Zanpamisaki Royal Hotel |
Load Balancing and Approximate Memory Minimization in Scale-Out System Architecture for Processing Requests That Follow Zipfian Distribution Takao Yamashita, Hiroyuki Kurita, Naoki Takada, Takuya Minami, Kenji Ota (NTT) IN2012-177 |
In this paper, we propose a load balancing method to process requests that follow a Zipfian distribution, which has extr... [more] |
IN2012-177 pp.137-142 |
PRMU |
2013-02-21 15:30 |
Osaka |
|
Fast and Memory Efficient Approximate Nearest Neighbor Search with Distance Estimation Based on Space Indexing Tomokazu Sato, Masakazu Iwamura, Koichi Kise (Osaka Pref Univ.) PRMU2012-142 |
(To be available after the conference date) [more] |
PRMU2012-142 pp.73-78 |
IN |
2012-04-12 13:55 |
Kyoto |
Kyotofu-Chusho-Kigyo-Kaikan |
Load Balancing Methods for Distribution Contains a Few Frequently Requested Keys and Many Rarely Requested Keys Hiroyuki Kurita, Naoki Takada, Takuya Minami, Takao Yamashita, Yuji Agawa (NTT) IN2012-2 |
The consistent hash method is known as a load balancing method for the case where a large number of requests are to be h... [more] |
IN2012-2 pp.7-12 |