Sciweavers

257 search results - page 40 / 52
» The convexity spectra of graphs
Sort
View
IPCO
2004
114views Optimization» more  IPCO 2004»
13 years 9 months ago
Enumerating Minimal Dicuts and Strongly Connected Subgraphs and Related Geometric Problems
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...
CVPR
2010
IEEE
13 years 7 months ago
Multi-view structure computation without explicitly estimating motion
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 ...
Hongdong Li
ICASSP
2010
IEEE
13 years 7 months ago
Large margin estimation of n-gram language models for speech recognition via linear programming
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...
Vladimir Magdin, Hui Jiang
JMIV
2006
161views more  JMIV 2006»
13 years 7 months ago
Image Restoration with Discrete Constrained Total Variation Part I: Fast and Exact Optimization
This paper deals with the total variation minimization problem in image restoration for convex data fidelityfunctionals.Weproposeanewandfastalgorithmwhichcomputesanexactsolutionint...
Jérôme Darbon, Marc Sigelle
CORR
2010
Springer
228views Education» more  CORR 2010»
13 years 6 months ago
Sparse Inverse Covariance Selection via Alternating Linearization Methods
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...
Katya Scheinberg, Shiqian Ma, Donald Goldfarb