Sciweavers

400 search results - page 2 / 80
» Extended formulations in combinatorial optimization
Sort
View
ICASSP
2011
IEEE
12 years 8 months ago
A combinatorial optimization framework for subset selection in distributed multiple-radar architectures
Abstract—Widely distributed multiple radar architectures offer parameter estimation improvement for target localization. For a large number of radars, the achievable localization...
Hana Godrich, Athina P. Petropulu, H. Vincent Poor
ACCV
2010
Springer
12 years 12 months ago
A Convex Image Segmentation: Extending Graph Cuts and Closed-Form Matting
Abstract. Image matting and segmentation are two closely related topics that concern extracting the foreground and background of an image. While the methods based on global optimiz...
Youngjin Park, Suk I. Yoo
IPCO
2010
231views Optimization» more  IPCO 2010»
13 years 6 months ago
Branched Polyhedral Systems
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
Volker Kaibel, Andreas Loos
DATE
2000
IEEE
89views Hardware» more  DATE 2000»
13 years 9 months ago
Architectural Power Optimization by Bus Splitting
– A split-bus architecture is proposed to improve the power dissipation for global data exchange among a set of modules. The resulting bus splitting problem is formulated and sol...
Cheng-Ta Hsieh, Massoud Pedram
ISVC
2007
Springer
13 years 11 months ago
Combinatorial Shape Decomposition
We formulate decomposition of two-dimensional shapes as a combinatorial optimization problem and present a dynamic programming algorithm that solves it.
Ralf Juengling, Melanie Mitchell