Searched refs:permutation (Results 1 – 10 of 10) sorted by relevance
377 std::vector<int32_t> permutation(rank); in transposeConstructor() local378 std::iota(permutation.begin(), permutation.end(), 0); in transposeConstructor()379 randomShuffle(&permutation); in transposeConstructor()381 std::copy(permutation.begin(), permutation.end(), in transposeConstructor()388 op->outputs[0]->dimensions[i] = op->inputs[0]->dimensions[permutation[i]]; in transposeConstructor()
92 * elements. The first n elements are still a permutation of [D0, …, Dn-1]. The last k93 * elements are a permutation of [Dn, …, Dn+k-1], defining how to traverse a block94 * internally. If not block sparse, the traversal order is just a permutation of [D0, …,
3008 * the permutation of the dimensions of the input tensor.
20 permutation encryption mode, this offers better resilience against malleability attacks (than other
1dictionary=main:da,locale=da,description=Dansk,date=1393228134, ...