175 search results - page 14 / 35 » Bounds for Permutation Rate-Distortion |
ISPAN
1997
IEEE
15 years 3 months ago
1997
IEEE
The shuffle-exchange permutation network (SEPn) is a fixed degree Cayley graph which has been proposed as a basis for massively parallel systems. We propose a routing algorithm wi...
FSE
2006
Springer
15 years 3 months ago
2006
Springer
We present PEP, which is a new construction of a tweakable strong pseudo-random permutation. PEP uses a hash-encrypt-hash approach which has recently been used in the construction...
CORR
2010
Springer
14 years 11 months ago
2010
Springer
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
TCS
2002
14 years 11 months ago
2002
Oblivious permutation routing in binary d-cubes has been well studied in the literature. In a permutation routing, each node initially contains a packet with a destination such th...
104
click to vote
COCOA
2008
Springer
15 years 13 days ago
2008
Springer
Solution symmetries in integer linear programs often yield long Branch-and-Bound based solution processes. We propose a method for finding elements of the permutation group of sol...