Sciweavers

1477 search results - page 75 / 296
» Random Convex Programs
Sort
View
SIAMCOMP
1998
137views more  SIAMCOMP 1998»
13 years 8 months ago
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
Sridhar Rajagopalan, Vijay V. Vazirani
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 8 months ago
Fractional generalizations of Young and Brunn-Minkowski inequalities
A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for...
Sergey Bobkov, Mokshay M. Madiman, Liyao Wang
JMLR
2010
158views more  JMLR 2010»
13 years 3 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 8 months ago
Stable Principal Component Pursuit
In this paper, we study the problem of recovering a low-rank matrix (the principal components) from a highdimensional data matrix despite both small entry-wise noise and gross spar...
Zihan Zhou, Xiaodong Li, John Wright, Emmanuel J. ...
AADEBUG
2005
Springer
13 years 10 months ago
Random testing of C calling conventions
In a C compiler, function calls are difficult to implement correctly because they must respect a platform-specific calling convention. But they are governed by a simple invariant...
Christian Lindig