175 search results - page 7 / 35 » Bounds for Permutation Rate-Distortion |
HICSS
2008
IEEE
15 years 7 months ago
2008
IEEE
A transposition is an operation that exchanges two adjacent substrings. When it is restricted so that one of the substrings is a prefix, it is called a prefix transposition. The p...
88
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
98
Voted
DCC
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper derives bounds on the distortion rate function for quantization on the complex projective space denoted as CPn−1 . In essence the problem of quantization in an Euclid...
TCC
2007
Springer
15 years 7 months ago
2007
Springer
We present a lower bound on the round complexity of a natural class of black-box constructions of statistically hiding commitments from one-way permutations. This implies a Ω( n ...
89
Voted
STOC
1987
ACM
15 years 4 months ago
1987
ACM
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...