It is supposed that the finite search space has certain symmetries which can be described in terms of a group of permutations acting upon it. If crossover and mutation respect th...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
This paper presents a construction of Slepian group codes from affine reflection groups. The solution to the initial vector and nearest distance problem is presented for all irred...
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
In this paper a novel recursive method for estimating structure and motion from image sequences is presented. The novelty lies in the fact that the output of the algorithm is inde...
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...