Sciweavers

112 search results - page 8 / 23
» Lagrangian Relaxation
Sort
View
CPAIOR
2005
Springer
14 years 29 days ago
Shorter Path Constraints for the Resource Constrained Shortest Path Problem
Abstract. Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constrain...
Thorsten Gellermann, Meinolf Sellmann, Robert Wrig...
ORL
2011
13 years 1 months ago
Convex approximations to sparse PCA via Lagrangian duality
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
Ronny Luss, Marc Teboulle
ICTAI
2005
IEEE
14 years 1 months ago
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Jiqing T...
ACCV
2007
Springer
13 years 11 months ago
Efficiently Solving the Fractional Trust Region Problem
Normalized Cuts has successfully been applied to a wide range of tasks in computer vision, it is indisputably one of the most popular segmentation algorithms in use today. A number...
Anders P. Eriksson, Carl Olsson, Fredrik Kahl
ICIP
2003
IEEE
14 years 9 months ago
Object-based video compression scheme with optimal bit allocation among shape, motion and texture
In object-based video, the encoding of the video data is decoupled into the encoding of shape, motion and texture information, which enables certain functionalities like content-b...
Haohong Wang, Guido M. Schuster, Aggelos K. Katsag...