Surrogate maximization (or minimization) (SM) algorithms are a family of algorithms that can be regarded as a generalization of expectation-maximization (EM) algorithms. There are...
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
The conventional method of generating a basis that is optimally adapted (in MSE) for representation of an ensemble of signals is Principal Component Analysis (PCA). A more ambitio...
Rosa M. Figueras i Ventura, Umesh Rajashekar, Zhou...
Fingerprinting is a widely used technique among the networking and security communities for identifying different implementations of the same piece of networking software running ...
Shobha Venkataraman, Juan Caballero, Pongsin Poosa...
In this paper we address a method of source separation in the case where sources have certain temporal structures. The key contribution in this paper is to incorporate Gaussian pro...