Sciweavers

1566 search results - page 9 / 314
» On a Cone Covering Problem
Sort
View
SOICT
2010
13 years 2 months ago
Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p
Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve...
Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuon...
IJRR
2002
105views more  IJRR 2002»
13 years 7 months ago
Computing Wrench Cones for Planar Rigid Body Contact Tasks
The contribution of this paper is the expansion of the range of possibilities in the analysis, planning, and control of contact tasks. The successful execution of any contact task...
Devin J. Balkcom, Jeffrey C. Trinkle
SIAMJO
2000
113views more  SIAMJO 2000»
13 years 7 months ago
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
Let F be a compact subset of the n-dimensional Euclidean space Rn represented by (finitely or infinitely many) quadratic inequalities. We propose two methods, one based on successi...
Masakazu Kojima, Levent Tunçel
CVPR
2006
IEEE
14 years 9 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
ECCV
1998
Springer
14 years 9 months ago
Faithful Least-Squares Fitting of Spheres, Cylinders, Cones and Tori for Reliable Segmentation
Abstract. This paper addresses a problem arising in the reverse engineering of solid models from depth-maps. We wish to identify and fit surfaces of known type wherever these are a...
A. David Marshall, Gábor Lukács, Ral...