116 search results - page 3 / 24 » Reformulation and convex relaxation techniques for global op... |
ACCV
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...
CP
2009
Springer
14 years 2 months ago
2009
Springer
The Maximum Density Sill-Life Problem is to fill an n × n board of cells with the maximum number of live cells so that the board is stable under the rules of Conway’s Game of L...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We use convex relaxation techniques to produce lower bounds on the optimal value of subset selection problems and generate good approximate solutions. We then explicitly bound the...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
The multi-label problem is of fundamental importance to computer vision, yet finding global minima of the associated energies is very hard and usually impossible in practice. Rec...
ICMS
2010
13 years 6 months ago
2010
Abstract. Most optimization software performs numerical computation, in the sense that the main interest is to find numerical values to assign to the decision variables, e.g. a so...