We consider the problems of enumerating all minimal strongly connected subgraphs and all minimal dicuts of a given directed graph G = (V, E). We show that the first of these proble...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
Most existing structure-from-motion methods follow a common two-step scheme, where relative camera motions are estimated in the first step and 3D structure is computed afterward ...
We present a novel discriminative training algorithm for n-gram language models for use in large vocabulary continuous speech recognition. The algorithm uses large margin estimati...
This paper deals with the total variation minimization problem in image restoration for convex data fidelityfunctionals.Weproposeanewandfastalgorithmwhichcomputesanexactsolutionint...
Gaussian graphical models are of great interest in statistical learning. Because the conditional independencies between different nodes correspond to zero entries in the inverse c...