The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
During our earlier research, it was recognised that in order to be successful with an indirect genetic algorithm approach using a decoder, the decoder has to strike a balance betw...
We propose a non-data-aided adaptive beamforming algorithm based on Widely Linear (WL) processing techniques and the Auxiliary Vector Filtering (AVF) algorithm for non-circular si...
Nuan Song, Jens Steinwandt, Lei Wang, Rodrigo C. d...
The two major Markov Random Fields (MRF) based algorithms for image segmentation are the Simulated Annealing (SA) and Iterated Conditional Modes (ICM). In practice, compared to the...