Results 1  10
of
3,234
On the distribution of the length of the longest increasing subsequence of random permutations
 J. Amer. Math. Soc
, 1999
"... Let SN be the group of permutations of 1, 2,...,N. If π ∈ SN,wesaythat π(i1),...,π(ik) is an increasing subsequence in π if i1 <i2 <·· · <ikand π(i1) < π(i2) < ···<π(ik). Let lN (π) be the length of the longest increasing subsequence. For example, if N =5andπis the permutation 5 1 ..."
Abstract

Cited by 495 (33 self)
 Add to MetaCart
Let SN be the group of permutations of 1, 2,...,N. If π ∈ SN,wesaythat π(i1),...,π(ik) is an increasing subsequence in π if i1 <i2 <·· · <ikand π(i1) < π(i2) < ···<π(ik). Let lN (π) be the length of the longest increasing subsequence. For example, if N =5andπis the permutation 5 1
Threedimensional object recognition from single twodimensional images
 Artificial Intelligence
, 1987
"... A computer vision system has been implemented that can recognize threedimensional objects from unknown viewpoints in single grayscale images. Unlike most other approaches, the recognition is accomplished without any attempt to reconstruct depth information bottomup from the visual input. Instead, ..."
Abstract

Cited by 484 (7 self)
 Add to MetaCart
, three other mechanisms are used that can bridge the gap between the twodimensional image and knowledge of threedimensional objects. First, a process of perceptual organization is used to form groupings and structures in the image that are likely to be invariant over a wide range of viewpoints. Second
Imprimitive Permutation Groups and
, 1999
"... block, cipher, trapdoor, cryptanalysis, linear, differential, permutation, group © Copyright HewlettPackard Company 1999 An iterated block cipher can be regarded as a means of producing a set of permutations of a message space. Some properties of the group generated by the round functions of such a ..."
Abstract
 Add to MetaCart
block, cipher, trapdoor, cryptanalysis, linear, differential, permutation, group © Copyright HewlettPackard Company 1999 An iterated block cipher can be regarded as a means of producing a set of permutations of a message space. Some properties of the group generated by the round functions
Imprimitive Permutations Groups
"... We answer a question of Paterson, showing that all block systems for the group generated by the round functions of a keyalternating block cipher are the translates of a linear subspace. Following up remarks of Paterson and Shamir, we exhibit a connection to truncated di#erential cryptanalysis. ..."
Abstract
 Add to MetaCart
We answer a question of Paterson, showing that all block systems for the group generated by the round functions of a keyalternating block cipher are the translates of a linear subspace. Following up remarks of Paterson and Shamir, we exhibit a connection to truncated di#erential cryptanalysis.
The affine permutation groups of rank three
 Proc. London Math. Soc
, 1987
"... Introduction and statement of results Finite primitive permutation groups of rank 3 have been the subject of much study in the past twenty years, leading on the one hand to interesting new groups (for instance, some sporadic groups) and on the other to new techniques in the theory of permutation gro ..."
Abstract

Cited by 40 (2 self)
 Add to MetaCart
Introduction and statement of results Finite primitive permutation groups of rank 3 have been the subject of much study in the past twenty years, leading on the one hand to interesting new groups (for instance, some sporadic groups) and on the other to new techniques in the theory of permutation
Imprimitive permutation groups and trapdoors in iterated block ciphers
 in Fast Software Encryption (L.R. Knudsen, ed), Lecture Notes in Computer Science 1636 (Springer–Verlag
, 1999
"... block, cipher, trapdoor, cryptanalysis, linear, differential, permutation, group An iterated block cipher can be regarded as a means of producing a set of permutations of a message space. Some properties of the group generated by the round functions of such a cipher are known to be of cryptanalytic ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
block, cipher, trapdoor, cryptanalysis, linear, differential, permutation, group An iterated block cipher can be regarded as a means of producing a set of permutations of a message space. Some properties of the group generated by the round functions of such a cipher are known to be of cryptanalytic
The Rank 3 Permutation Representations Of The Finite Classical Groups
 TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
, 1982
"... The permutation representations in the title are all determined, and no surprises are found to occur. ..."
Abstract

Cited by 28 (4 self)
 Add to MetaCart
The permutation representations in the title are all determined, and no surprises are found to occur.
ON TRANSITIVE PERMUTATION GROUPS WITH AN IMPRIMITIVITY BLOCK OF PRIME LENGTH
"... ABSTRACT. Let G be a transitive permutation group on a finite set 12. Let 23 ={A 1,A2,...,At) be a system of imprimitivity for G on 12 with [All = p, a prime. Assume that the kernel of G on 23 is not faithful on A 1. It is proved that either G contains a nontrivial normal elementary abelian psubgro ..."
Abstract
 Add to MetaCart
ABSTRACT. Let G be a transitive permutation group on a finite set 12. Let 23 ={A 1,A2,...,At) be a system of imprimitivity for G on 12 with [All = p, a prime. Assume that the kernel of G on 23 is not faithful on A 1. It is proved that either G contains a nontrivial normal elementary abelian p
PROJECTIVE SYSTEMS OF IMPRIMITIVITY
, 1994
"... We apply Mackey procedure of classifying projective systems of imprimitivity to a thorough study of the projective unitary irreducible representations of the Galilei group in 1+3 and 1+2 dimensions. 1 ..."
Abstract
 Add to MetaCart
We apply Mackey procedure of classifying projective systems of imprimitivity to a thorough study of the projective unitary irreducible representations of the Galilei group in 1+3 and 1+2 dimensions. 1
Results 1  10
of
3,234