Sciweavers

985 search results - page 81 / 197
» Piercing Convex Sets
Sort
View
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 6 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
COLT
2005
Springer
14 years 3 months ago
General Polynomial Time Decomposition Algorithms
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
Nikolas List, Hans-Ulrich Simon
ISIPTA
2003
IEEE
145views Mathematics» more  ISIPTA 2003»
14 years 3 months ago
An Extended Set-valued Kalman Filter
Set-valued estimation offers a way to account for imprecise knowledge of the prior distribution of a Bayesian statistical inference problem. The set-valued Kalman filter, which p...
Darryl Morrell, Wynn C. Stirling
DCG
1999
81views more  DCG 1999»
13 years 10 months ago
Properties of Random Triangulations and Trees
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
Luc Devroye, Philippe Flajolet, Ferran Hurtado, Ma...
SIAMJO
2010
79views more  SIAMJO 2010»
13 years 8 months ago
Theta Bodies for Polynomial Ideals
Inspired by a question of Lov´asz, we introduce a hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal, called theta...
João Gouveia, Pablo A. Parrilo, Rekha R. Th...