Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IN |
2014-04-17 13:00 |
Kyoto |
Kyotofu-Chusho-Kigyo-Kaikan |
Elastic and strict load balancing via consistent hashing Yuichi Nakatani, Hiroyuki Kurita, Naoki Takada, Takao Yamashita (NTT) IN2014-1 |
Load balancing is a key function constructing massively distributed systems. Stateful services like SIP and distributed ... [more] |
IN2014-1 pp.1-6 |
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) |
2014-03-06 11:20 |
Miyazaki |
Miyazaki Seagia |
Routing Algorithm for Distributed Key-Value Store using OpenFlow Hiroyuki Sugimura, Toshihiro Nishizono (Nihon Univ) NS2013-214 |
This paper proposes an OpenFlow based routing mechanism for distributed key-value store using consistent hashing. Each s... [more] |
NS2013-214 pp.219-224 |
EMM, ISEC, SITE, ICSS, IPSJ-CSEC, IPSJ-SPT [detail] |
2013-07-19 12:55 |
Hokkaido |
|
On Identification Methods for Visible-Light Paper Artifact-Metric Systems Ryosuke Suzuki, Tsutomu Matsumoto (Yokohama National Univ.) ISEC2013-41 SITE2013-36 ICSS2013-46 EMM2013-43 |
A visible-light paper artifact-metric system authenticates a piece of paper using its individual pattern of entangled fi... [more] |
ISEC2013-41 SITE2013-36 ICSS2013-46 EMM2013-43 pp.289-295 |
COMP |
2013-04-24 10:35 |
Hyogo |
Kobe University |
Approximate Permuted Pattern Matching and Indexing Structure for Multi-Track Data Hiroyuki Ota, Takashi Katsura, Kazuyuki Narisawa, Ayumi Shinohara (Tohoku Univ.) COMP2013-2 |
A multi-track data is a multi-set of sequences.
The permuted pattern matching problem is, given a multi-track text and ... [more] |
COMP2013-2 pp.9-16 |
NS, IN (Joint) |
2013-03-07 09:40 |
Okinawa |
Okinawa Zanpamisaki Royal Hotel |
Simulation evaluation of connection delay characteristics in large scale SIP service node clusters Keita Iwabuchi, Toshihiro Nishizono (Nihon Univ.), Kiyoshi Ueda (NTT) NS2012-202 |
This paper describes connection delay characteristic evaluation of the SIP service node composed of a database cluster m... [more] |
NS2012-202 pp.213-218 |
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 |
IBISML |
2012-11-07 15:30 |
Tokyo |
Bunkyo School Building, Tokyo Campus, Tsukuba Univ. |
Fast Gaussian Process Regression using hash function Yuya Okadome, Yutaka Nakamura, Hiroshi Ishiguro (Osaka Univ.) IBISML2012-55 |
A Gaussian Process Regression (GPR) has ability to deal with a non-linear regression easily.
However, the calculation c... [more] |
IBISML2012-55 pp.151-155 |
MVE, ITE-HI, HI-SIG-VR |
2012-06-26 16:25 |
Tokyo |
Sanjo Conference Hall |
Fast Hash-Based Inpainting for Virtualized-Reality Indoor Modeling Kalaivani Thangamani, Tomoya Ishikawa, Koji Makita, Takeshi Kurata (AIST) MVE2012-18 |
This paper discusses the hash table usage for the Exemplar-Based inpainting method to speed up the inpainting process. T... [more] |
MVE2012-18 pp.55-60 |
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 |
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 |
IN |
2012-01-27 13:00 |
Hokkaido |
Asahikawa-Terminal-Hotel |
A Load Balancing Method for Consistent Hashing with Consideration for Heterogeneity of Node Capability Michio Irie, Eriko Iwasa, Masashi Kaneko, Takeshi Fukumoto, Masami Iio (NTT) IN2011-131 |
For scale-out session control servers, there are two requirements for the effective utilization of hardware resources; s... [more] |
IN2011-131 pp.65-70 |
DE |
2011-12-16 10:45 |
Kyoto |
Kyoto Sangyo University |
A Method to Reduce Remote Accesses in L1-Distance-based Distributed Locality-Sensitive Hashing and Its Implementation Evaluation Hisashi Koga, Toshinori Watanabe (UEC) DE2011-40 |
Locality-Sensitive Hashing (LSH) is an approximate nearest-neighbor search algorithm for high-dimensional data. Though L... [more] |
DE2011-40 pp.1-6 |
PRMU, DE |
2011-06-07 14:00 |
Kanagawa |
|
Duplicate Registration of Data in Approximate Nearest Neighbor Masakazu Iwamura, Tomoyuki Muto, Koichi Kise (Osaka Prefecture Univ.) DE2011-20 PRMU2011-51 |
We propose a new method based on duplicate registration of data
in approximate nearest neighbor problem.
In the experi... [more] |
DE2011-20 PRMU2011-51 pp.111-116 |
PRMU, DE |
2011-06-07 16:10 |
Kanagawa |
|
Video retrieval method based on the improved Tiny LSH using image and audio features Noboru Murabayashi, Kenichi Yoshida (Univ. of Tsukuba) DE2011-23 PRMU2011-54 |
The rapid spread of the broad band internet increases the importance of the copied video detection method from large-sca... [more] |
DE2011-23 PRMU2011-54 pp.125-130 |
ISEC, IT, WBS |
2011-03-04 15:20 |
Osaka |
Osaka University |
Robust image hashing against geometric attacks using image normalization and SVD decomposition Ricardo Antonio Parrao Hernandez (IPN-MEX), Brian M. Kurkoski (Univ. of Electro-Comm.), Mariko Nakano Miyatake (IPN-MEX) IT2010-102 ISEC2010-106 WBS2010-81 |
This paper uses SVD decomposition and image normalization algorithm to generate a hash value of a digital image. SVD dec... [more] |
IT2010-102 ISEC2010-106 WBS2010-81 pp.221-226 |
PRMU |
2011-02-18 13:30 |
Saitama |
|
Performance comparison of the hashing retrieval method for the large-scale video data Noboru Murabayashi, Kenichi Yoshida (Univ. of Tsukuba) PRMU2010-226 |
In the previous researchs, we proposed the Tiny LSH method as a high-speed retrieval technique for the large-scale vide... [more] |
PRMU2010-226 pp.117-122 |
PRMU, MVE, IPSJ-CVIM [detail] |
2011-01-21 15:20 |
Shiga |
|
Image-based Indoor localization of Visitors using Time Variation
-- for Applying to Museums -- Hisato Kawaji, Soichiro Kawamura, Toshihiko Yamasaki, Kiyoharu Aizawa (The Univ. of Tokyo) PRMU2010-185 MVE2010-110 |
In this paper, we proposed an estimation approach of visitors’ routes in a museum. Our approach is based on the image ma... [more] |
PRMU2010-185 MVE2010-110 pp.291-296 |