60 search results - page 2 / 12 » Simple Permutations Mix Well |
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
RSA
2000
13 years 5 months ago
2000
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
Spin systems are a general way to describe local interactions between nodes in a graph. In statistical mechanics, spin systems are often used as a model for physical systems. In c...
COR
2010
13 years 5 months ago
2010
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
ASAP
2000
IEEE
13 years 9 months ago
2000
IEEE
MicroSIMD architectures incorporating subword parallelism are very efficient for application-specific media processors as well as for fast multimedia information processing in gen...