Sciweavers

365 search results - page 38 / 73
» Numerical Solving of Geometric Constraints
Sort
View
EOR
2008
93views more  EOR 2008»
14 years 9 months ago
Approximate methods for convex minimization problems with series-parallel structure
Consider a problem of minimizing a separable, strictly convex, monotone and differentiable function on a convex polyhedron generated by a system of m linear inequalities. The probl...
Adi Ben-Israel, Genrikh Levin, Yuri Levin, Boris R...
75
Voted
ECAI
2004
Springer
15 years 3 months ago
Improving Asynchronous Backtracking for Dealing with Complex Local Problems
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...
Arnold Maestre, Christian Bessière
PAMI
2011
14 years 4 months ago
Linearized Motion Estimation for Articulated Planes
—In this paper, we describe the explicit application of articulation constraints for estimating the motion of a system of articulated planes. We relate articulations to the relat...
Ankur Datta, Yaser Sheikh, Takeo Kanade
88
Voted
ICML
2008
IEEE
15 years 10 months ago
Graph kernels between point clouds
Point clouds are sets of points in two or three dimensions. Most kernel methods for learning on sets of points have not yet dealt with the specific geometrical invariances and pra...
Francis R. Bach
3DIM
2005
IEEE
15 years 3 months ago
Stereo by Multiperspective Imaging under 6 DOF Camera Motion
Multiperspective imaging has been used to recover the structure of a scene. Although several algorithms for structure recovery have been developed as typified by stereo panoramas...
Naoyuki Ichimura