1666 search results - page 86 / 334 » Smoothed Motion Complexity |
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
— The last decade, sampling based planners like the Probabilistic Roadmap Method have proved to be successful in solving complex motion planning problems. We give a reachability ...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
SIGGRAPH
1999
ACM
14 years 1 months ago
1999
ACM
This paper presents a technique for adapting existing motion of a human-like character to have the desired features that are specified by a set of constraints. This problem can b...
AVSS
2006
IEEE
14 years 3 months ago
2006
IEEE
Although the use of super-resolution techniques has demonstrated the ability to improve face recognition accuracy when compared to traditional upsampling techniques, they are dif...
ICCV
2011
IEEE
12 years 9 months ago
2011
IEEE
In geometric computer vision, the structure from motion (SfM) problem can be formulated as a optimization problem with a rank constraint. It is well known that the trace norm of a...