The weighted path length of optimum binary search trees is bounded above by Y'./3i + 2 a. + H where H is the entropy of the frequency distribution, /3i is the total weight of the internal nodes, and aj is the total weight of the leaves. This bound is best possible. A linear time algorithm for constructing nearly optimal trees is described. One of the popular methods for retrieving information b...

Intersection graphs are well-studied in the area of graph algorithms. Some intersection classes known to have algorithms enumerating all unlabeled by reverse search. Since these output one and numbers vast, they work only for a small number vertices. Binary decision diagrams (BDDs) compact data structures various types useful solving optimization enumeration problems. This study proposes five c...

Abstract. A hyperplane search tree is a binary tree used to store a set S of n d-dimensional data points. In a random hyperplane search tree for S, the root represents a hyperplane defined by d data points drawn uniformly at random from S. The remaining data points are split by the hyperplane, and the definition is used recursively on each subset. We assume that the data are points in general p...

Millions of people use online dating sites each day, scanning through streams of face images in search of an attractive mate. Face images, like most visual stimuli, undergo processes whereby the current percept is altered by exposure to previous visual input. Recent studies using rapid sequences of faces have found that perception of face identity is biased towards recently seen faces, promotin...

Particle swarm optimization (PSO), an intelligent optimization algorithm inspired by the flocking behavior of birds, has been shown to perform well and widely used to solve the continuous problem. But the traditional PSO and most of its variants are developed for optimization problems in continuous space, which are not able to solve the binary combinational optimization problem. To tackle this ...

The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing device like a laser range-scanner. An encoding of space in combination with a new region search algorithm is introduced. The algorithm allows for fast access to spherical subsets of variable size. An octree based and a ba...