: Numerous fast algorithms for the Discrete Cosine Transform DCT have been proposed. Until recently, it has been di cult to compare di erent DCT algorithms and select one which i...
We give the first efficient parallel algorithms for solving the arrangement problem. We give a deterministic algorithm for the CREW PRAM which runs in nearly optimal bounds of O(lo...
We present a new algorithm for Unique Games which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programmi...
The particle swarm algorithm contains elements which map fairly strongly to the foraging problem in behavioural ecology. In this paper, we show how some simple adaptions to the sta...
Image segmentation is an important process of image analysis. Most of the published approaches for image segmentation need to set appropriate parameter values to cope with the unc...