1483 search results - page 59 / 297 » Geometric constraint satisfaction using optimization methods |
130
click to vote
ICCV
1999
IEEE
15 years 5 months ago
1999
IEEE
We show that the set of all ow- elds in a sequence of frames imaging a rigid scene resides in a lowdimensional linear subspace. Based on this observation, we develop a method for ...
87
Voted
ICRA
2005
IEEE
15 years 7 months ago
2005
IEEE
— In [5], a version of Relative Map Filter (RMF) is proposed to solve the simultaneous localization and map building (SLAM) problem. In the RMF, the map states contain only quant...
118
click to vote
DAC
2005
ACM
15 years 3 months ago
2005
ACM
This paper presents a new method for designing test wrappers for embedded cores with multiple clock domains. By exploiting the use of multiple shift frequencies, the proposed meth...
128
click to vote
SIAMJO
2000
15 years 1 months ago
2000
Mathematical programs with nonlinear complementarity constraints are reformulated using better-posed but nonsmooth constraints. We introduce a class of functions, parameterized by...
140
Voted
CP
2011
Springer
14 years 1 months ago
2011
Springer
A depth-first search algorithm can be used to find optimal solutions of a Constraint Satisfaction Problem (CSP) with respect to a set of conditional preferences statements (e.g.,...