Sciweavers

2031 search results - page 172 / 407
» Approximation Algorithms for 2-Stage Stochastic Optimization...
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
Near-Optimal Sparse Recovery in the L1 Norm
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
Piotr Indyk, Milan Ruzic
FOCS
2004
IEEE
14 years 2 days ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...
CVPR
2005
IEEE
14 years 10 months ago
Estimating 3D Shape and Texture Using Pixel Intensity, Edges, Specular Highlights, Texture Constraints and a Prior
We present a novel algorithm aiming to estimate the 3D shape, the texture of a human face, along with the 3D pose and the light direction from a single photograph by recovering th...
Sami Romdhani, Thomas Vetter
SIAMJO
2010
136views more  SIAMJO 2010»
13 years 3 months ago
A New Exchange Method for Convex Semi-Infinite Programming
In this paper we propose a new exchange method for solving convex semi-infinite programming (CSIP) problems. We introduce a new dropping-rule in the proposed exchange algorithm, wh...
Liping Zhang, Soon-Yi Wu, Marco A. López
JMM2
2007
96views more  JMM2 2007»
13 years 8 months ago
A Framework for Linear Transform Approximation Using Orthogonal Basis Projection
—This paper aims to develop a novel framework to systematically trade-off computational complexity with output distortion in linear multimedia transforms, in an optimal manner. T...
Yinpeng Chen, Hari Sundaram