We present a novel primal-dual analysis on a class of NPhard sparsity minimization problems to provide new interpretations for their well known convex relaxations. We show that th...
We address the problem of learning the parameters in graphical models when inference is intractable. A common strategy in this case is to replace the partition function with its B...
We address the online linear optimization problem with bandit feedback. Our contribution is twofold. First, we provide an algorithm (based on exponential weights) with a regret of...
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
In this paper, a salient region extraction method for creating picture collage based on stereo vision is proposed. Picture collage is a kind of visual image summary to arrange all...
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach
In many information networks, data items – such as updates in social networks, news flowing through interconnected RSS feeds and blogs, measurements in sensor networks, route u...
This paper presents a query evaluation technique for positive relational algebra queries with aggregates on a representation system for probabilistic data based on the algebraic s...