We consider the problem of partitioning a graph into cliques of bounded cardinality. The goal is to find a partition that minimizes the sum of clique costs where the cost of a clique is given by a set function on the nodes. ...

One of the main challenges researchers face is to identify the most relevant features in a prediction model. As a consequence, many regularized methods seeking sparsity have flourished. Although sparse, their solutions may ...

The subject of this thesis is the design of Wireless Sensor Networks (WSN). Given a limited set of sensors and a single sinks, we are particularly interested in the topological WSN design problem. This problem consists in ...

We present an efficient algorithm to find nonempty minimizers of a symmetric submodular function f over any family of sets I closed under inclusion. Our algorithm makes O(n(3)) oracle calls to f and I, where n is the ...