691 search results - page 16 / 139 » Path Consistency by Dual Consistency |
WEA
2004
Springer
14 years 28 days ago
2004
Springer
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
SIBGRAPI
2006
IEEE
14 years 1 months ago
2006
IEEE
In this work we propose a method for the polygonization of octree-based reconstructions by dual contouring. Dual contouring is an adaptive method for determining contiguous polygo...
CVIU
2008
13 years 7 months ago
2008
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
NECO
2008
13 years 7 months ago
2008
We describe a fast Sequential Minimal Optimization (SMO) procedure for solving the dual optimization problem of the recently proposed Potential Support Vector Machine (P-SVM). The...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...