Given a graph G = (V, E) with node weights v N {0}, v V , and some number F N{0}, the convex hull of the incidence vectors of all cuts (S), S V with (S) F and (V \ S) F is ...
Michael Armbruster, Christoph Helmberg, Marzena F&...
Abstract—Intuitively, identification of nodes close to the network edge is key to the successful setup, and continued operation, of many sensor network protocols and application...
—We propose an efficient and robust solution for image set classification. A joint representation of an image set is proposed which includes the image samples of the set and thei...
We address the problem of learning a kernel for a given supervised learning task. Our approach consists in searching within the convex hull of a prescribed set of basic kernels fo...
Andreas Argyriou, Raphael Hauser, Charles A. Micch...
—Resource allocation promises significant benefits in wireless networks. In order to fully reap these benefits, it is important to design efficient resource allocation algori...