As databases increasingly integrate non-textual information it is becoming necessary to support eecient similarity searching in addition to range searching. Recently, declustering techniques have been proposed for improving the performance of similarity searches through parallel I/O. In this paper, we propose a new scheme which provides good declus-tering for similarity searching. In particular...

In this paper we describe a new data structure that supports orthogonal range reporting queries on a set of points that move along linear trajectories on a U × U grid. The assumption that points lie on a U × U grid enables us to significantly decrease the query time in comparison to the standard kinetic model. Our data structure answers queries in O( √ logU/ log logU + k) time, where k denotes ...

The VTIR team participated in the Lifelog Semantic Access Task of the NTCIR-12 2016. We proposed an approach to pre-process the visual concepts of the photos and reconstruct queries from two aspects. Due to limited time, our efforts were constrained. Our main contribution was to learn and incorporate location of each photo to improve search accuracy. The evaluation demonstrated that our approac...

Consider search designs for searching one nonzero 2- or 3-factor interaction under the search linear model. In the noisy case, search probability is given by Shirakura et al. (Ann. Statist. 24(6) (1996) 2560). In this paper some new properties of the searching probability are presented. New properties of the search probability enable us to compare designs, which depend on an unknown parameter ?...