112 search results - page 8 / 23 » Lagrangian Relaxation |
CPAIOR
2005
Springer
15 years 3 months ago
2005
Springer
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...
149
click to vote
ORL
2011
14 years 3 months ago
2011
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. ...
ICTAI
2005
IEEE
15 years 3 months ago
2005
IEEE
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...
94
Voted
ACCV
2007
Springer
15 years 1 months ago
2007
Springer
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...
83
Voted
ICIP
2003
IEEE
15 years 11 months ago
2003
IEEE
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...