Results 1  10
of
1,344
2 All Possible Permutation Characters of M11 5
, 1999
"... This is a loose collection of examples of computations with permutation characters and possible permutation characters in the GAP system [GAP04]. We mainly use the GAP implementation of the algorithms to compute possible permutation characters that are described in [BP98], and information from the A ..."
Abstract
 Add to MetaCart
This is a loose collection of examples of computations with permutation characters and possible permutation characters in the GAP system [GAP04]. We mainly use the GAP implementation of the algorithms to compute possible permutation characters that are described in [BP98], and information from
Contents 1 Some Computations with M24 2 2 All Possible Permutation Characters of M11 4
, 1999
"... This is a loose collection of examples of computations with permutation characters and possible permutation characters in the GAP system [GAP04]. We mainly use the GAP implementation of the algorithms to compute possible permutation characters that are described in [BP98], and information from the A ..."
Abstract
 Add to MetaCart
This is a loose collection of examples of computations with permutation characters and possible permutation characters in the GAP system [GAP04]. We mainly use the GAP implementation of the algorithms to compute possible permutation characters that are described in [BP98], and information from
2.1 Computing Possible Permutation Characters....................... 4 2.2 Verifying the Candidates................................... 5
, 2006
"... We complete the classification of the multiplicityfree permutation actions of nearly simple groups that involve a sporadic simple group, which had been started in [BL96] and [LM]. ..."
Abstract
 Add to MetaCart
We complete the classification of the multiplicityfree permutation actions of nearly simple groups that involve a sporadic simple group, which had been started in [BL96] and [LM].
Limits on the Provable Consequences of Oneway Permutations
, 1989
"... We present strong evidence that the implication, "if oneway permutations exist, then secure secret key agreement is possible" is not provable by standard techniques. Since both sides of this implication are widely believed true in real life, to show that the implication is false requir ..."
Abstract

Cited by 200 (0 self)
 Add to MetaCart
We present strong evidence that the implication, "if oneway permutations exist, then secure secret key agreement is possible" is not provable by standard techniques. Since both sides of this implication are widely believed true in real life, to show that the implication is false
Routing Permutations on Graphs via Matchings
 SIAM Journal on Discrete Mathematics
, 1994
"... We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble ” which has a unique destination π(v) in G (so that π is a permutation of the vertices of G). It is required to route all the pebbles to their respective destinations by performing a ..."
Abstract

Cited by 44 (2 self)
 Add to MetaCart
a sequence of moves of the following type: A disjoint set of edges is selected and the pebbles at each edge’s endpoints are interchanged. The problem of interest is to minimize the number of steps required for any possible permutation π. In this paper we investigate this routing problem for a
Quasicyclic lowdensity paritycheck codes from circulant permutation matrices
 IEEE Trans. Inf. Theory
, 2004
"... Abstract—In this correspondence, the construction of lowdensity paritycheck (LDPC) codes from circulant permutation matrices is investigated. It is shown that such codes cannot have a Tanner graph representation with girth larger than 12, and a relatively mild necessary and sufficient condition fo ..."
Abstract

Cited by 124 (0 self)
 Add to MetaCart
Abstract—In this correspondence, the construction of lowdensity paritycheck (LDPC) codes from circulant permutation matrices is investigated. It is shown that such codes cannot have a Tanner graph representation with girth larger than 12, and a relatively mild necessary and sufficient condition
Permutation Reconstruction
"... In this paper, we consider the problem of permutation reconstruction. This problem is an analogue of graph reconstruction, a famous question in graph theory. In the case of permutations, the problem can be stated as follows: In all possible ways, delete k entries of the permutation p = p1p2p3...pn a ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
In this paper, we consider the problem of permutation reconstruction. This problem is an analogue of graph reconstruction, a famous question in graph theory. In the case of permutations, the problem can be stated as follows: In all possible ways, delete k entries of the permutation p = p1p2p3...pn
Benchmarking attribute selection techniques for discrete class data mining
 IEEE Trans. Knowl. Data Eng
"... Data engineering is generally considered to be a central issue in the development of data mining applications. The success of many learning schemes, in their attempts to construct models of data, hinges on the reliable identification of a small set of highly predictive attributes. The inclusion of i ..."
Abstract

Cited by 184 (2 self)
 Add to MetaCart
. This leads to a large number of possible permutations and has led to a situation where very few benchmark studies have been conducted. This paper presents a benchmark comparison of several attribute selection methods. All the methods produce an attribute ranking, a useful devise for isolating the individual
Multidimensional Analysis of Rankings Permutations
"... In this paper we illustrate an original approach to factorial analysis of rankings data. The proposed technique is based on the decomposition of the Spearman’s rank correlation matrix defined on a whole set of permutation. The properties of such correlation matrix will be discussed. The complete set ..."
Abstract
 Add to MetaCart
set of permutation is defined univocally from the size, n, of the ordering task. Indeed, dealing with the class of untied ordinal data, the dataset to reduce is provided, for any given n, by all the possible permutations of the first n integer numbers. The analysis we propose is performed in two steps
Malware Phylogeny Generation using Permutations of Code
 JOURNAL IN COMPUTER VIROLOGY
, 2005
"... Malicious programs, such as viruses and worms, are frequently related to previous programs through evolutionary relationships. Discovering those relationships and constructing a phylogeny model is expected to be helpful for analyzing new malware and for establishing a principled naming scheme. Mat ..."
Abstract

Cited by 43 (6 self)
 Add to MetaCart
. Matching permutations of code may help build better models in cases where malware evolution does not keep things in the same order. We describe method for constructing phylogeny models that uses features called nperms to match possibly permuted code. An experiment was performed to compare the relative
Results 1  10
of
1,344