In this paper we consider the problem of computing the closest point to the boundary of a circle among a set S of n points. We present two algorithms to solve this problem. One al...
The DIRECT global optimization algorithm is tested on the BBOB 2009 testbed. The algorithm is rather time and space consuming since it does not forget any point it samples during ...
We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal O(n log n) time and oc...
In order to search similar moving object trajectories, the previously used methods focused on Euclidean distance and considered only spatial similarity. Euclidean distance is not a...
We describe an approach for constructing search spaces that consist of highly relevant web pages using similarities between the contents of linked web pages to represent their lin...
Aki Kobayashi, Kuangmin Tan, Katsunori Yamaoka, Yo...