Sciweavers

337 search results - page 11 / 68
» Semidefinite Programming Based Approximation Algorithms
Sort
View
ICIP
2007
IEEE
14 years 9 months ago
Color Image Superresolution Based on a Stochastic Combinational Classification-Regression Algorithm
Abstract - The proposed algorithm in this work provides superresolution for color images by using a learning based technique that utilizes both generative and discriminant approach...
Karl S. Ni, Truong Q. Nguyen
ICPR
2008
IEEE
14 years 8 months ago
Solving quadratically constrained geometrical problems using lagrangian duality
In this paper we consider the problem of solving different pose and registration problems under rotational constraints. Traditionally, methods such as the iterative closest point ...
Carl Olsson, Anders Eriksson
SIAMJO
2002
133views more  SIAMJO 2002»
13 years 7 months ago
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Abstract. Sequential quadratic programming (SQP) methods have proved highly effective for solving constrained optimization problems with smooth nonlinear functions in the objective...
Philip E. Gill, Walter Murray, Michael A. Saunders
STOC
2003
ACM
164views Algorithms» more  STOC 2003»
14 years 7 months ago
Approximate counting by dynamic programming
We give efficient algorithms to sample uniformly, and count approximately, the solutions to a zero-one knapsack problem. The algorithm is based on using dynamic programming to pro...
Martin E. Dyer
CDC
2008
IEEE
206views Control Systems» more  CDC 2008»
14 years 2 months ago
Approximate dynamic programming using support vector regression
— This paper presents a new approximate policy iteration algorithm based on support vector regression (SVR). It provides an overview of commonly used cost approximation architect...
Brett Bethke, Jonathan P. How, Asuman E. Ozdaglar