Abstract--In this paper we investigate the sparsity and recognition capabilities of two approximate Bayesian classification algorithms, the multi-class multi-kernel Relevance Vecto...
Ioannis Psorakis, Theodoros Damoulas, Mark A. Giro...
We consider distributed algorithms to optimize random access multihop wireless networks in the presence of fading. Since the associated optimization problem is neither convex nor ...
Assuming that a set of source signals is sparsely representable in a given dictionary, we show how their sparse recovery fails whenever we can only measure a convolved observation...
—In this contribution we provide a thorough stability analysis of gradient type algorithms with non-symmetric matrix step-sizes. We hereby extend existing analyses for symmetric ...
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...