Results 1  10
of
1,293
On Optimal Permutation Codes
 IEEE Trans. Inform. Theory
, 2001
"... Permutation codes are vector quantizers whose codewords are related by permutations and, in one variant, sign changes. Asymptotically, as the vector dimension grows, optimal Variant I permutation code design is identical to optimal entropyconstrained scalar quantizer (ECSQ) design. However, contrad ..."
Abstract

Cited by 15 (9 self)
 Add to MetaCart
Permutation codes are vector quantizers whose codewords are related by permutations and, in one variant, sign changes. Asymptotically, as the vector dimension grows, optimal Variant I permutation code design is identical to optimal entropyconstrained scalar quantizer (ECSQ) design. However
Almost Optimal Permutation Routing on Hypercubes
"... This paper deals with permutation routing on hypercube networks in the storeandforward model. We introduce the first (online and offline) algorithms routing any permutation on the ddimensional hypercube in d + o(d) steps. The best previously known results were 2d + o(d) (oblivious online) and 2 ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper deals with permutation routing on hypercube networks in the storeandforward model. We introduce the first (online and offline) algorithms routing any permutation on the ddimensional hypercube in d + o(d) steps. The best previously known results were 2d + o(d) (oblivious online
Optimal permutation routing on mesh networks
 Proc. of the 2007 International Network Optimization Conference (INOC 07
, 2007
"... networks. ..."
Solving Tiling Using Optimal Permutations
, 1997
"... Introduction Program partitioning and scheduling is an important problem to be addressed in compiling for scalable parallel machines. Specifically, the problem of the optimalassignment of tasks to processors for speeding up the execution is quite crucial and is also very complex [8, 5]. The efficie ..."
Abstract
 Add to MetaCart
Introduction Program partitioning and scheduling is an important problem to be addressed in compiling for scalable parallel machines. Specifically, the problem of the optimalassignment of tasks to processors for speeding up the execution is quite crucial and is also very complex [8, 5]. The efficiency of the speed up depends on the way the tasks are mapped on to the processors and on their order of execution. Indeed, to get a good speed up, we need to : ffl Distribute the tasks on the processors in as equally as possible. ffl Minimize communication between processors considering the delays of the network. Tiling is one of the most popular techniques used in Automatic Parallelization for minimizing communication in mapping iteration spaces on to the processors [12, 1, 11]. The important motivation behind tiling is to improve locality [7] and data reuse [2, 10, 4] that results in lesser communication. There have been a number of im
COPERM: TransformDomain Energy Compaction by Optimal Permutation
 IEEE Trans. Image Processing
, 1999
"... Compaction by optimal permutation (COPERM) is a tool for transformdomain energy compaction of broadband signals, whose foundation is a simple but powerful idea: Any signal can be transformed to resemble a more desirable (e.g., from a transformdomain compaction viewpoint) signal from a class of &qu ..."
Abstract
 Add to MetaCart
Compaction by optimal permutation (COPERM) is a tool for transformdomain energy compaction of broadband signals, whose foundation is a simple but powerful idea: Any signal can be transformed to resemble a more desirable (e.g., from a transformdomain compaction viewpoint) signal from a class
COPERM: TransformDomain Energy Compaction by Optimal Permutation
, 1998
"... COPERM (Compaction by Optimal PERMutation) is a tool for transformdomain energy compaction of broadband signals, whose foundation is a simple but powerful idea: any signal can be transformed to resemble a more desirable (e.g., from a transformdomain compaction viewpoint) signal from a class of &qu ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
COPERM (Compaction by Optimal PERMutation) is a tool for transformdomain energy compaction of broadband signals, whose foundation is a simple but powerful idea: any signal can be transformed to resemble a more desirable (e.g., from a transformdomain compaction viewpoint) signal from a class
OPTIMAL PERMUTATION CORRECTION BY MULTIOBJECTIVE GENETIC ALGORITHMS
"... The separation of convolved signals can be performed in the frequency domain by splitting the signal into frequency bands, applying ICA techniques to each band and reassembling all bands to obtain the separated output signals. As ICA cannot guarantee for any ordering of output signals, the reassembl ..."
Abstract
 Add to MetaCart
, the reassembly of the frequency bands must use some additional information in order to assign the frequency bands consistently to the right output. A number of different criteria have been proposed to solve this permutation problem. We have applied genetic algorithms at this point, which have the advantage
Optimal Permutation Routing for Lowdimensional Hypercubes
, 2006
"... We consider the offline problem of routing a permutation of tokens on the nodes of a ddimensional hypercube, under a queueless MIMD communication model (under the constraints that each hypercube edge may only communicate one token per communication step, and each node may only be occupied by a sing ..."
Abstract
 Add to MetaCart
We consider the offline problem of routing a permutation of tokens on the nodes of a ddimensional hypercube, under a queueless MIMD communication model (under the constraints that each hypercube edge may only communicate one token per communication step, and each node may only be occupied by a
Results 1  10
of
1,293