A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
For a collection F of d-variate piecewise linear functions of overall combinatorial complexity n, the lower envelope E(F) of F is the pointwise minimum of these functions. The min...
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
We present an algorithm which provides the one-dimensional subspace where the Bayes error is minimized for the C class problem with homoscedastic Gaussian distributions. Our main ...
Shannon's sampling theory and its variants provide effective solutions to the problem of reconstructing a signal from its samples in some "shift-invariant" space, wh...
Sathish Ramani, Dimitri Van De Ville, Thierry Blu,...