Results 11  20
of
1,344
Parsing Permutation Phrases
, 2001
"... A permutation phrase is a sequence of elements (possibly of di#erent types) in which each element occurs exactly once and the order is irrelevant. Some of the permutable elements may be optional. We show a way to extend a parser combinator library with support for parsing such freeorder constructs. ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
A permutation phrase is a sequence of elements (possibly of di#erent types) in which each element occurs exactly once and the order is irrelevant. Some of the permutable elements may be optional. We show a way to extend a parser combinator library with support for parsing such freeorder constructs
Detecting and exploiting permutation structures in MIPs
"... Abstract. Many combinatorial optimization problems can be formulated as the search for the best possible permutation of a given set of objects, according to a given objective function. The corresponding MIP formulation is thus typically made of an assignment substructure, plus additional constraint ..."
Abstract
 Add to MetaCart
Abstract. Many combinatorial optimization problems can be formulated as the search for the best possible permutation of a given set of objects, according to a given objective function. The corresponding MIP formulation is thus typically made of an assignment substructure, plus additional
Efficient inference for distributions on permutations
 Advances in Neural Information Processing Systems
, 2008
"... Permutations are ubiquitous in many real world problems, such as voting, rankings and data association. Representing uncertainty over permutations is challenging, since there are n! possibilities, and typical compact representations such as graphical models cannot efficiently capture the mutual excl ..."
Abstract

Cited by 22 (6 self)
 Add to MetaCart
Permutations are ubiquitous in many real world problems, such as voting, rankings and data association. Representing uncertainty over permutations is challenging, since there are n! possibilities, and typical compact representations such as graphical models cannot efficiently capture the mutual
SMALL PERMUTATION CLASSES
, 2007
"... We establish a phase transition for permutation classes (downsets of permutations under the permutation containment order): there is an algebraic number κ, approximately 2.20557, for which there are only countably many permutation classes of growth rate (StanleyWilf limit) less than κ but uncountab ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
but uncountably many permutation classes of growth rate κ, answering a question of Klazar. We go on to completely characterize the possible subκ growth rates of permutation classes, answering a question of Kaiser and Klazar. Central to our proofs are the concepts of generalized grid classes (introduced herein
Ballot Permutations in Prêt à Voter
, 2009
"... Handling full permutations of the candidate list along with reencryption mixes is rather difficult in Prêt à Voter but handling cyclic shifts is straightforward. One of the versions of Prêt à Voter that uses Paillier encryption allows general permutations of candidates on the ballot, rather than ju ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
the number of possible permutations is much larger than the number of voters, and we propose a construction that addresses this issue while retaining the defence against an adversary who can shift checkmarks. 1
Algebraic quantum permutation groups
 Goswami, D.: Quantum Group of isometries in Classical and Non Commutative Geometry
"... Abstract. We discuss some algebraic aspects of quantum permutation groups, working over arbitrary fields. If K is any characteristic zero field, we show that there exists a universal cosemisimple Hopf algebra coacting on the diagonal algebra K n: this is a refinement of Wang’s universality theorem f ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
for the (compact) quantum permutation group. We also prove a structural result for Hopf algebras having a nonergodic coaction on the diagonal algebra K n, on which we determine the possible group gradings when K is algebraically closed and has characteristic zero. 1.
The Convex Geometry of Linear Inverse Problems
, 2010
"... In applications throughout science and engineering one is often faced with the challenge of solving an illposed inverse problem, where the number of available measurements is smaller than the dimension of the model to be estimated. However in many practical situations of interest, models are constr ..."
Abstract

Cited by 189 (20 self)
 Add to MetaCart
. The class of simple models considered are those formed as the sum of a few atoms from some (possibly infinite) elementary atomic set; examples include wellstudied cases such as sparse vectors (e.g., signal processing, statistics) and lowrank matrices (e.g., control, statistics), as well as several others
Characters and modular properties of permutation orbifolds
, 1998
"... Abstract Explicit formulae describing the genus one characters and modular transformation properties of permutation orbifolds of arbitrary Rational Conformal Field Theories are presented, and their relation to the theory of covering surfaces is investigated. If C denotes a Rational Conformal Field T ..."
Abstract

Cited by 37 (1 self)
 Add to MetaCart
permutation x ∈ Sn of the n ”replicas ” is a global symmetry of C ⊗n, so it is possible to orbifoldize C ⊗n by any permutation group Ω < Sn. For reasons to become clear soon, we shall denote the resulting permutation orbifold by C ≀ Ω. The first systematic investigation of permutation orbifolds has been
Universal cycles for permutations
 Discrete Mathematics
"... A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n + 1 distinct integers are used. This is best possible and proves ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n + 1 distinct integers are used. This is best possible
Comparison of the Power of the Paired Samples using Permutation Tests
"... The t test is classic for testing a paired comparison when the distribution of difference scores from a random sample are normally distributed. For unspecified distributions, the sign test or the Wilcoxon signed rank test can be utilized. Without knowledge of the underlying distributions, the permut ..."
Abstract
 Add to MetaCart
, the permutation test can be utilized both for the original observations as well as their ranks. For the permutation test, the significance level is exact when calculating all possible permutations. The approximate significance level is used when the numbers of permutations are very large. A simulation study
Results 11  20
of
1,344