221 search results - page 3 / 45 » Efficient sampling of random permutations |
SPAA
1993
ACM
13 years 8 months ago
1993
ACM
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
MOR
2008
13 years 4 months ago
2008
SODA
2010
ACM
14 years 1 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
BMCBI
2007
13 years 4 months ago
2007
Background: Gene Set Enrichment Analysis (GSEA) is a computational method for the statistical evaluation of sorted lists of genes or proteins. Originally GSEA was developed for in...
SCN
2008
Springer
13 years 4 months ago
2008
Springer
Abstract. We propose and analyse a new countermeasure against Differential Power Analysis (DPA) for the AES encryption algorithm, based on permutation tables. As opposed to existin...