We analyze a class of estimators based on a convex relaxation for solving highdimensional matrix decomposition problems. The observations are the noisy realizations of the sum of ...
Alekh Agarwal, Sahand Negahban, Martin J. Wainwrig...
Complementation of finite automata on infinite words is not only a fundamental problem in automata theory, but also serves as a cornerstone for solving numerous decision problem...
Many applications involve multiple-modalities such as text and images that describe the problem of interest. In order to leverage the information present in all the modalities, on...
The space-time geometric structure of Maxwell’s equations is examined and a subset of them is found to define a pair of exact discrete time-stepping relations. The desirability ...
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...