633 search results - page 23 / 127 » Locality and Hard SAT-Instances |
IPPS
2010
IEEE
13 years 7 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
CVPR
2007
IEEE
14 years 11 months ago
2007
IEEE
In this paper we present a method for learning a curve model for detection and segmentation by closely integrating a hierarchical curve representation using generative and discrim...
CVPR
2008
IEEE
14 years 11 months ago
2008
IEEE
We introduce a novel local image descriptor designed for dense wide-baseline matching purposes. We feed our descriptors to a graph-cuts based dense depth map estimation algorithm ...
ICDE
2007
IEEE
14 years 4 months ago
2007
IEEE
— In video indexing and summarization, video text is the very compact and accurate information. Most video text detection and extraction methods deal with the static videotext on...
CPAIOR
2010
Springer
14 years 2 months ago
2010
Springer
Constrained Optimum Path (COP) problems arise in many real-life applications and are ubiquitous in communication networks. They have been traditionally approached by dedicated algo...