Given a bounded universe {0, 1, . . . , U-1}, we show how to perform (successor) searches in O(log log ) expected time and updates in O(log log ) expected amortized time, where i...
Abstract. Search engines traditionally index unstructured text and return ranked lists of documents that match a given query. As search engines functionally move in the direction o...
Abstract. We present a modified version of the Particle swarm Optimization algorithm in which we adjust the virtual swarm search by incorporating inter-agent dynamics native to mul...
Video signatures are compact representations of video sequences designed for efficient similarity measurement. In this paper, we propose a feature extraction technique to support ...
— This paper presents an object active visual search behavior in a 3D environment performed by a HRP-2 humanoid robot. The search is formalized as an optimization problem in whic...