3082 search results - page 45 / 617 » New Bounds for the Controller Problem |
132
Voted
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
121
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
140
Voted
CDC
2008
IEEE
15 years 10 months ago
2008
IEEE
— In this paper we develop a new dual decomposition method for optimizing a sum of convex objective functions corresponding to multiple agents but with coupled constraints. In ou...
142
Voted
CP
2003
Springer
15 years 9 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
113
click to vote
COR
2008
15 years 3 months ago
2008
This paper presents two new mathematical formulations for the Point-Feature Cartographic Label Placement Problem (PFCLP ) and a new Lagrangean relaxation with clusters (LagClus) t...