We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure Greedy Algorithm and th...
David L. Donoho, Michael Elad, Vladimir N. Temlyak...
The recent developments in computer and communication technologies gave rise to Personal Communication Systems. Due to the nature of the PCS, the bandwidth allocation problem arise...
Dimitrios Katsaros, Alexandros Nanopoulos, Murat K...
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
We consider the problem of automatically cleaning massive sonar data point clouds, that is, the problem of automatically removing noisy points that for example appear as a result ...
Abstract. Littlestone developed a simple deterministic on-line learning algorithm for learning k-literal disjunctions. This algorithm (called Winnow) keeps one weight for each of t...