Sciweavers

429 search results - page 5 / 86
» Permutative Additives and Exponentials
Sort
View
COMBINATORICS
2002
71views more  COMBINATORICS 2002»
13 years 7 months ago
Permutations Which Avoid 1243 and 2143, Continued Fractions, and Chebyshev Polynomials
Several authors have examined connections between permutations which avoid 132, continued fractions, and Chebyshev polynomials of the second kind. In this paper we prove analogues...
Eric S. Egge, Toufik Mansour
RSA
2008
89views more  RSA 2008»
13 years 7 months ago
Simple permutations mix even better
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask how many randomly selected simple permutations need be composed to...
Alex Brodsky, Shlomo Hoory
DM
2007
83views more  DM 2007»
13 years 7 months ago
Restricted colored permutations and Chebyshev polynomials
Several authors have examined connections between restricted permutations and Chebyshev polynomials of the second kind. In this paper we prove analogues of these results for color...
Eric S. Egge
ASIACRYPT
2000
Springer
13 years 12 months ago
Addition of ElGamal Plaintexts
Abstract. We introduce an efficient method for performing computation on encrypted data, allowing addition of ElGamal encrypted plaintexts. We demonstrate a solution that is robust...
Markus Jakobsson, Ari Juels
JMLR
2010
135views more  JMLR 2010»
13 years 2 months ago
An Exponential Model for Infinite Rankings
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large. A human ranker will then typically r...
Marina Meila, Le Bao