Sciweavers

48 search results - page 2 / 10
» Constructing Permutation Representations for Large Matrix Gr...
Sort
View
ICICS
2004
Springer
13 years 11 months ago
On the Minimal Assumptions of Group Signature Schemes
Abstract. One of the central lines of cryptographic research is identifying the weakest assumptions required for the construction of secure primitives. In the context of group sign...
Michel Abdalla, Bogdan Warinschi
ISSAC
2007
Springer
107views Mathematics» more  ISSAC 2007»
13 years 12 months ago
A disk-based parallel implementation for direct condensation of large permutation modules
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
Eric Robinson, Jürgen Müller 0004, Gene ...
PAMI
1998
100views more  PAMI 1998»
13 years 5 months ago
Hilbert-Schmidt Lower Bounds for Estimators on Matrix Lie Groups for ATR
—Deformable template representations of observed imagery, model the variability of target pose via the actions of the matrix Lie groups on rigid templates. In this paper, we stud...
Ulf Grenander, Michael I. Miller, Anuj Srivastava
TCAD
2002
110views more  TCAD 2002»
13 years 5 months ago
A constructive genetic algorithm for gate matrix layout problems
This paper describes an application of a Constructive Genetic Algorithm (CGA) to the Gate Matrix Layout Problem (GMLP). The GMLP happens in very large scale integration (VLSI) desi...
Alexandre César Muniz de Oliveira, Luiz Ant...
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 6 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...