Sciweavers

5019 search results - page 112 / 1004
» Computing in Quotient Groups
Sort
View
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
16 years 4 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
DCC
2008
IEEE
16 years 4 months ago
Sequences in abelian groups G of odd order without zero-sum subsequences of length exp ( G )
We present a new construction for sequences in the finite abelian group Cr n without zero-sum subsequences of length n, for odd n. This construction improves the maximal known car...
Yves Edel
DCC
2001
IEEE
16 years 4 months ago
The Invariants of the Clifford Groups
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...
Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane
CVPR
2010
IEEE
16 years 24 days ago
Monocular SLAM with Locally Planar Landmarks via Geometric Rao-Blackwellized Particle Filtering on Lie groups
We propose a novel geometric Rao-Blackwellized particle filtering framework for monocular SLAM with locally planar landmarks. We represent the states for the camera pose and the la...
Junghyun Kwon (Seoul National University) and Kyou...
PARELEC
2000
IEEE
15 years 8 months ago
Implementation of an Adaptive Reconfigurable Group Organized (ARGO) Parallel Architecture
The purpose of this paper is to demonstrate the implementation of an adaptable parallel architecture capable of system to task adaptation. The system implementation was based on X...
Lucas Szajek, Lev Kirischian