Search academic resources

Approximation algorithms for a class of planar graph problems, including planar independent set, planar vertex cover and planar dominating set, were intensively studied. The current upper bound on the running time of the...

This paper proposes two parallel variants of an Estimation of Distribution Algorithm (EDA) that represents the probability distribution by means of a single connected graphical model based on a polytree structure. The ma...

Se propone la ágil visualización de grandes escenarios exteriores a partir de la fusión de versiones simplificadas de modelos digitales de elevación y de fotografías aéreas o satelitales de la zona. Tales aproximac...

The Gale-Shapley "propose/reject" algorithm is a wellknown procedure for solving the classical stable marriage problem. In this paper we study this algorithm in the context of the many-to-many stable marriage problem, al...

In recent years there has been a growing interest in the study of sparse representation of signals. Using an overcomplete dictionary that contains prototype signal-atoms, signals are described by sparse linear combinatio...