2254 search results - page 213 / 451 » Computing the minimal covering set |
180
click to vote
AIPS
2009
15 years 7 months ago
2009
Planning based on propositional SAT(isfiability) is a powerful approach to computing step-optimal plans given a parallel execution semantics. In this setting: (i) a solution plan ...
169
click to vote
ECCV
2000
Springer
16 years 8 months ago
2000
Springer
The paper has two main contributions: The rst is a set of methods for computing structure and motion for m 3 views of 6 points. It is shown that a geometric image error can be mini...
131
click to vote
CGI
2006
IEEE
16 years 22 days ago
2006
IEEE
One of the main question addressed by paleoanthropologists is the recovery of plausible motions for extinct species whose knowledge is generally limited to incomplete bones and ske...
149
click to vote
IPPS
1999
IEEE
15 years 11 months ago
1999
IEEE
The system of equations that govern kinematically redundant manipulators is commonly solved by nding the singular value decomposition (SVD) of the corresponding Jacobian matrix. T...
150
click to vote
IPPS
1994
IEEE
15 years 10 months ago
1994
IEEE
Present-day parallel computers often face the problems of large software Overheadsfor process switching and interprocessor communication. These problems are addressed by the Multi...