Sciweavers

2969 search results - page 44 / 594
» A space efficient algorithm for group structure computation
Sort
View
EC
2002
121views ECommerce» more  EC 2002»
15 years 2 months ago
Group Properties of Crossover and Mutation
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
TIT
2008
115views more  TIT 2008»
15 years 2 months ago
Affine Reflection Group Codes
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...
Terasan Niyomsataya, Ali Miri, Monica Nevins
ICDT
2009
ACM
105views Database» more  ICDT 2009»
16 years 3 months ago
Efficient data structures for range-aggregate queries on trees
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...
Hao Yuan, Mikhail J. Atallah
CVPR
1997
IEEE
16 years 5 months ago
Recursive Structure and Motion from Image Sequences using Shape and Depth Spaces
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...
Rikard Berthilsson, Anders Heyden, Gunnar Sparr
COMPGEOM
2010
ACM
15 years 8 months ago
A dynamic data structure for approximate range searching
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 ...
David M. Mount, Eunhui Park