Sciweavers

848 search results - page 39 / 170
» Randomness and the linear degrees of computability
Sort
View
CORR
2012
Springer
225views Education» more  CORR 2012»
13 years 7 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
CVPR
2007
IEEE
16 years 1 months ago
Two-View Motion Segmentation from Linear Programming Relaxation
This paper studies the problem of multibody motion segmentation, which is an important, but challenging problem due to its well-known chicken-and-egg-type recursive character. We ...
Hongdong Li
CORR
2011
Springer
153views Education» more  CORR 2011»
14 years 6 months ago
Partially Linear Bayesian Estimation with Application to Sparse Approximations
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
Tomer Michaeli, Daniel Sigalov, Yonina C. Eldar
POPL
2005
ACM
16 years 3 days ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula
SIAMJO
2010
130views more  SIAMJO 2010»
14 years 6 months ago
A Randomized Cutting Plane Method with Probabilistic Geometric Convergence
Abstract. We propose a randomized method for general convex optimization problems; namely, the minimization of a linear function over a convex body. The idea is to generate N rando...
Fabrizio Dabbene, P. S. Shcherbakov, Boris T. Poly...