14548 search results - page 434 / 2910 » The Optimal Path-Matching Problem |
226
click to vote
FOCS
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
219
click to vote
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
222
click to vote
GECCO
2003
Springer
16 years 25 days ago
2003
Springer
The problem of searching for a walker that wants to be found, when the walker moves toward the helicopter when it can hear it, is an example of a two sided search problem which is ...
214
click to vote
GECCO
2009
Springer
16 years 7 days ago
2009
Springer
HyperNEAT, a generative encoding for evolving artificial neural networks (ANNs), has the unique and powerful ability to exploit the geometry of a problem (e.g., symmetries) by enc...
192
click to vote
STOC
2006
ACM
16 years 8 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...