175 search results - page 7 / 35 » Bounds for Permutation Rate-Distortion |
136
click to vote
HICSS
2008
IEEE
16 years 19 days 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...
152
click to vote
DCC
2006
IEEE
16 years 7 days 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...
167
Voted
TCC
2007
Springer
16 years 8 days 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 ...
144
Voted
STOC
1987
ACM
15 years 9 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 ...