Sciweavers

85 search results - page 13 / 17
» On Sorting Permutations by Double-Cut-and-Joins
Sort
View
TISSEC
2010
72views more  TISSEC 2010»
14 years 8 months ago
Deterring voluntary trace disclosure in re-encryption mix-networks
An all too real threat to the privacy offered by a mix network is that individual mix administrators may volunteer partial tracing information to a coercer. While this threat can ...
XiaoFeng Wang, Philippe Golle, Markus Jakobsson, A...
79
Voted
CORR
2006
Springer
138views Education» more  CORR 2006»
14 years 9 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
FCT
2007
Springer
15 years 3 months ago
A String-Based Model for Simple Gene Assembly
Abstract. The simple intramolecular model for gene assembly in ciliates is particularly interesting because it can predict the correct assembly of all available experimental data, ...
Robert Brijder, Miika Langille, Ion Petre
MFCS
2005
Springer
15 years 3 months ago
Approximating Reversal Distance for Strings with Bounded Number of Duplicates
For a string A = a1 . . . an, a reversal ρ(i, j), 1 ≤ i < j ≤ n, transforms the string A into a string A = a1 . . . ai−1ajaj−1 . . . aiaj+1 . . . an, that is, the reve...
Petr Kolman
IEEEPACT
1999
IEEE
15 years 1 months ago
Localizing Non-Affine Array References
Existing techniques can enhance the locality of arrays indexed by affine functions of induction variables. This paper presents a technique to localize non-affine array references,...
Nicholas Mitchell, Larry Carter, Jeanne Ferrante