Sciweavers

215 search results - page 17 / 43
» Sums of squares based approximation algorithms for MAX-SAT
Sort
View
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 10 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
ICCV
2005
IEEE
14 years 2 months ago
Non-Orthogonal Binary Subspace and Its Applications in Computer Vision
This paper presents a novel approach that represents an image or a set of images using a nonorthogonal binary subspace (NBS) spanned by boxlike base vectors. These base vectors po...
Hai Tao, Ryan Crabb, Feng Tang
ICIP
2007
IEEE
14 years 10 months ago
Statistically Driven Sparse Image Approximation
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
Rosa M. Figueras i Ventura, Eero P. Simoncelli
ISMB
1998
13 years 10 months ago
Compression of Strings with Approximate Repeats
We describe a model for strings of characters that is loosely based on the Lempel Ziv model with the addition that a repeated substring can be an approximate match to the original...
Lloyd Allison, Timothy Edgoose, Trevor I. Dix
CDC
2010
IEEE
13 years 3 months ago
Stochastic approximation for consensus with general time-varying weight matrices
This paper considers consensus problems with delayed noisy measurements, and stochastic approximation is used to achieve mean square consensus. For stochastic approximation based c...
Minyi Huang