32 search results - page 6 / 7 » On permutations with bounded drop size |
SIAMJO
2008
13 years 4 months ago
2008
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
DAGSTUHL
2007
13 years 6 months ago
2007
In this paper, we prove that the quadratic polynomials modulo 3 with the largest correlation with parity are unique up to permutation of variables and constant factors. As a conseq...
DAM
2007
13 years 4 months ago
2007
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
EUROCRYPT
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Digital Signatures emerge naturally from Public-Key Encryption based on trapdoor permutations, and the “duality” of the two primitives was noted as early as Diffie-He...
IPPS
2006
IEEE
13 years 11 months ago
2006
IEEE
In this paper we consider the map construction problem in the case of an anonymous, unoriented torus of unknown size. An agent that can move from node to neighbouring node in the ...