Sciweavers

429 search results - page 18 / 86
» Permutative Additives and Exponentials
Sort
View
TCBB
2010
137views more  TCBB 2010»
13 years 2 months ago
The Metropolized Partial Importance Sampling MCMC Mixes Slowly on Minimum Reversal Rearrangement Paths
Markov chain Monte Carlo has been the standard technique for inferring the posterior distribution of genome rearrangement scenarios under a Bayesian approach. We present here a neg...
István Miklós, Bence Melykuti, Krist...
BMCBI
2005
93views more  BMCBI 2005»
13 years 7 months ago
Two-part permutation tests for DNA methylation and microarray data
Background: One important application of microarray experiments is to identify differentially expressed genes. Often, small and negative expression levels were clipped-off to be e...
Markus Neuhäuser, Tanja Boes, Karl-Heinz J&ou...
IACR
2011
106views more  IACR 2011»
12 years 7 months ago
Hash Functions Based on Three Permutations: A Generic Security Analysis
We consider the family of 2n-to-n-bit compression functions that are solely based on at most three permutation executions and on XOR-operators, and analyze its collision and preima...
Bart Mennink, Bart Preneel
ASIACRYPT
2007
Springer
14 years 1 months ago
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
Ueli M. Maurer, Dominik Raub
COCO
2004
Springer
84views Algorithms» more  COCO 2004»
14 years 1 months ago
Properties of NP-Complete Sets
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
Christian Glaßer, Aduri Pavan, Alan L. Selma...