1144 search results - page 134 / 229 » Fractal Algorithm for Finding Global Optimal Solution |
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We present an effective method to optimize over the parameters of an image patch descriptor to obtain one that is computationally more efficient while maintaining a high recogniti...
EVOW
2007
Springer
15 years 4 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
ISPD
1999
ACM
15 years 2 months ago
1999
ACM
—This paper studies a natural formulation of the timing-driven maze routing problem. A multigraph model appropriate for global routing applications is adopted; the model naturall...
118
click to vote
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
Covering and packing integer programs model a large family of combinatorial optimization problems. The current-best approximation algorithms for these are an instance of the basic...